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 14, 2026 01:31Victor MerckléVictor MerckléScore: 7,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 01:317,43871,620,65661,740,00002,113,536
2May 14, 2026 01:317,43971,556,39561,746,00002,113,536
3May 14, 2026 01:317,44070,373,44461,753,00002,113,536
4May 14, 2026 01:317,44173,190,77460,762,0001,004,0002,113,536
5May 14, 2026 01:317,44869,802,79760,816,0001,009,0002,113,536
6May 14, 2026 01:317,44971,101,36560,819,0001,013,0002,113,536
7May 14, 2026 01:317,44971,220,09560,760,0001,071,0002,113,536
8May 14, 2026 01:317,45069,163,39960,816,0001,026,0002,113,536
9May 14, 2026 01:317,49872,436,34362,237,00002,113,536