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 listMay 25, 2026 01:05Maya RebholzMaya RebholzError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 01:050122,234,406110,737,0002,073,0002,113,536expected "53694613906052295 ", got "53694613902053176 "
2May 25, 2026 01:0513,498122,633,225110,973,0001,064,0002,113,536
3May 25, 2026 01:0513,527122,531,172111,234,0001,046,0002,113,536
4May 25, 2026 01:0513,527123,165,431111,230,0001,051,0002,113,536
5May 25, 2026 01:0513,549122,175,363111,403,0001,058,0002,113,536
6May 25, 2026 01:0513,563123,982,217111,510,0001,067,0002,113,536
7May 25, 2026 01:0513,635124,770,557112,124,0001,054,0002,113,536
8May 25, 2026 01:0513,659123,029,276112,318,0001,053,0002,113,536
9May 25, 2026 01:0513,694123,510,113112,601,0001,060,0002,113,536