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 listApr 10, 2026 10:50Danylo MocherniukDanylo MocherniukScore: 4,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 10:504,85362,676,37738,268,0002,014,0002,285,568
2Apr 10, 2026 10:504,86764,925,29838,377,0002,019,0002,293,760
3Apr 10, 2026 10:504,88361,598,28738,507,0002,026,0002,293,760
4Apr 10, 2026 10:504,92562,982,32437,886,0002,991,0002,285,568
5Apr 10, 2026 10:504,96664,624,71739,209,0002,010,0002,293,760
6Apr 10, 2026 10:505,08171,010,58240,165,0002,008,0002,273,280