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 8, 2026 01:26Sayura LokhandeSayura LokhandeScore: 2,070,983Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2026 01:262,068,90517,207,100,38917,101,946,00069,967,0002,293,760
2Apr 8, 2026 01:262,069,60817,217,661,78417,105,783,00071,965,0002,293,760
3Apr 8, 2026 01:262,069,98417,216,471,94117,105,901,00074,964,0002,281,472
4Apr 8, 2026 01:262,070,38917,218,698,66717,131,254,00052,972,0002,281,472
5Apr 8, 2026 01:262,070,98317,221,262,74517,125,187,00063,970,0002,281,472
6Apr 8, 2026 01:262,071,59717,232,775,49817,120,290,00073,966,0002,281,472
7Apr 8, 2026 01:262,071,64317,228,344,75117,119,679,00074,959,0002,281,472
8Apr 8, 2026 01:262,071,82517,230,595,37217,132,174,00063,970,0002,281,472
9Apr 8, 2026 01:262,082,83417,320,933,28717,211,564,00075,962,0002,289,664