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 19, 2026 13:44Victor MerckléVictor MerckléScore: 5,890Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 13:455,87656,553,53047,750,0001,022,0002,113,536
2May 19, 2026 13:455,87856,733,05547,760,0001,029,0002,113,536
3May 19, 2026 13:455,88256,593,92147,815,0001,010,0002,113,536
4May 19, 2026 13:455,88558,482,14547,829,0001,024,0002,113,536
5May 19, 2026 13:455,89059,552,57047,865,0001,023,0002,113,536
6May 19, 2026 13:455,96059,247,86948,461,0001,014,0002,113,536
7May 19, 2026 13:456,00459,294,65648,814,0001,024,0002,113,536
8May 19, 2026 13:456,06958,600,53849,374,0001,004,0002,113,536
9May 19, 2026 13:456,07659,231,78949,410,0001,023,0002,113,536