Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMay 6, 2026 00:24olliecrowolliecrowError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 00:25019,353,5971,461,00002,379,776expected "53681490010653532 ", got "T1PFX 8 759375308 2133178263 1507562182 253919909 679163384 637786387 662782368 1249007864 12414696149725886707 "
2May 6, 2026 00:25017,706,0171,574,00002,379,776expected "53686994227628297 ", got "T1PFX 8 746555804 928628601 64060637 20674885 1162980601 2016797436 652079284 2059132210 6496021319558942405 "
3May 6, 2026 00:25016,807,7701,440,00002,379,776expected "53677995808189812 ", got "T1PFX 8 145045657 556282266 1098859109 1032724015 705291231 845653715 1146255055 61396127 8577315825257914805 "