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 18, 2026 17:27wnwnScore: 7,478Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 17:276,29074,601,87950,203,0002,008,0002,260,992
2Feb 18, 2026 17:276,51576,778,75252,075,0002,002,0002,338,816
3Feb 18, 2026 17:276,52077,538,53952,113,0002,004,0002,510,848
4Feb 18, 2026 17:277,47885,937,21359,062,0003,003,0002,412,544
5Feb 18, 2026 17:277,50685,376,37659,282,0003,014,0002,437,120
6Feb 18, 2026 17:277,87487,270,68060,327,0005,027,0002,392,064