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 29, 2026 10:01wnwnScore: 3,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 10:023,31636,264,77827,530,000020,480
2Sep 29, 2026 10:023,32336,345,20927,589,000020,480
3Sep 29, 2026 10:023,32636,461,37127,611,000020,480
4Sep 29, 2026 10:023,32736,487,66627,621,000020,480
5Sep 29, 2026 10:023,32836,464,20427,624,000020,480
6Sep 29, 2026 10:023,32836,601,83227,628,000020,480
7Sep 29, 2026 10:023,33336,494,00627,664,000020,480
8Sep 29, 2026 10:023,33636,606,74727,696,000020,480
9Sep 29, 2026 10:023,35136,485,63826,796,0001,022,00020,480