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 02:13Victor MerckléVictor MerckléScore: 9,330Success
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 02:149,32686,519,77276,403,0001,006,0002,113,536
2May 13, 2026 02:149,32784,676,19176,373,0001,042,0002,113,536
3May 13, 2026 02:149,32986,469,36876,425,0001,008,0002,113,536
4May 13, 2026 02:149,32984,720,42576,430,0001,004,0002,113,536
5May 13, 2026 02:149,33086,647,88776,417,0001,030,0002,113,536
6May 13, 2026 02:149,33386,765,88976,457,0001,010,0002,113,536
7May 13, 2026 02:149,35386,758,72576,619,0001,013,0002,113,536
8May 13, 2026 02:149,37085,623,36176,756,0001,015,0002,113,536
9May 13, 2026 02:149,45285,894,22377,431,0001,028,0002,113,536