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 listSep 24, 2026 03:18wnwnScore: 3,352Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:193,33436,504,56226,649,0001,029,0002,113,536
2Sep 24, 2026 03:193,33636,457,08426,663,0001,034,0002,113,536
3Sep 24, 2026 03:193,34936,624,71726,768,0001,032,0002,113,536
4Sep 24, 2026 03:193,35136,632,08226,805,0001,011,0002,113,536
5Sep 24, 2026 03:193,35236,600,87326,820,0001,002,0002,113,536
6Sep 24, 2026 03:193,35836,611,37726,841,0001,034,0002,113,536
7Sep 24, 2026 03:193,53338,738,88228,280,0001,047,0002,113,536
8Sep 24, 2026 03:193,54438,192,31128,405,0001,012,0002,113,536
9Sep 24, 2026 03:193,55738,985,85628,525,0001,001,0002,113,536