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 10, 2026 13:18wnwnScore: 3,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:193,25734,696,73427,038,00002,113,536
2May 10, 2026 13:193,26335,910,21827,087,00002,113,536
3May 10, 2026 13:193,26636,051,97727,113,00002,113,536
4May 10, 2026 13:193,27034,993,15027,148,00002,113,536
5May 10, 2026 13:193,27237,204,42427,158,00002,113,536
6May 10, 2026 13:193,38935,273,87228,135,00002,113,536
7May 10, 2026 13:193,41238,597,48028,324,00002,113,536
8May 10, 2026 13:193,42040,247,82728,387,00002,113,536
9May 10, 2026 13:193,43937,616,48827,506,0001,038,0002,113,536