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 listFeb 2, 2026 20:38javivallejojavivallejoScore: 58,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 20:3858,827513,526,683486,267,0002,001,0002,519,040
2Feb 2, 2026 20:3858,829514,391,960488,278,00002,400,256
3Feb 2, 2026 20:3858,835510,974,732486,332,0002,001,0002,260,992
4Feb 2, 2026 20:3858,836514,933,046488,335,00002,379,776
5Feb 2, 2026 20:3858,842513,639,283488,387,00002,519,040
6Feb 2, 2026 20:3858,843515,130,268487,393,0001,000,0002,510,848
7Feb 2, 2026 20:3858,845516,290,024487,416,0001,000,0002,519,040
8Feb 2, 2026 20:3858,850520,392,896488,454,00002,265,088
9Feb 2, 2026 20:3858,867520,003,743485,601,0002,997,0002,519,040