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 listMar 10, 2026 14:41JarnoJarnoScore: 390,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 14:41389,7423,265,289,3623,156,886,00077,972,0002,359,296
2Mar 10, 2026 14:41389,8073,262,685,3523,152,439,00082,958,0002,281,472
3Mar 10, 2026 14:41389,9223,266,027,9613,153,399,00082,957,0002,281,472
4Mar 10, 2026 14:41390,5963,270,240,2573,166,975,00074,975,0002,281,472
5Mar 10, 2026 14:41390,6413,264,272,1623,170,359,00071,962,0002,359,296
6Mar 10, 2026 14:41392,2503,277,793,5433,198,696,00056,976,0002,281,472
7Mar 10, 2026 14:41392,4143,282,527,7673,208,048,00048,985,0002,281,472
8Mar 10, 2026 14:41393,5593,293,399,4553,197,573,00068,969,0002,285,568
9Mar 10, 2026 14:41395,0653,306,020,1853,219,076,00059,964,0002,285,568