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 13, 2026 08:37Victor MerckléVictor MerckléScore: 8,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 08:388,28178,936,28665,511,0003,223,0002,121,728stderr
2May 13, 2026 08:388,28578,353,96665,517,0003,251,0002,121,728stderr
3May 13, 2026 08:388,28679,360,77665,503,0003,276,0002,121,728stderr
4May 13, 2026 08:388,28679,843,22065,520,0003,256,0002,121,728stderr
5May 13, 2026 08:388,28879,927,43065,516,0003,279,0002,121,728stderr
6May 13, 2026 08:388,28977,603,91765,527,0003,273,0002,121,728stderr
7May 13, 2026 08:388,29079,263,06865,570,0003,241,0002,121,728stderr
8May 13, 2026 08:388,29278,082,05065,577,0003,247,0002,121,728stderr
9May 13, 2026 08:388,29677,531,46365,628,0003,230,0002,121,728stderr