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 15:26wnwnScore: 7,359Success
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 15:267,33384,369,04258,873,0001,995,0002,281,472
2Feb 18, 2026 15:267,35081,087,93259,004,0002,000,0002,277,376
3Feb 18, 2026 15:267,35388,497,65859,027,0002,000,0002,281,472
4Feb 18, 2026 15:267,35983,266,55559,075,0002,002,0002,277,376
5Feb 18, 2026 15:267,36684,650,34059,132,0002,004,0002,277,376
6Feb 18, 2026 15:267,37184,930,71759,175,0002,005,0002,445,312