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 20, 2026 11:30Victor MerckléVictor MerckléScore: 5,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 11:315,56454,050,53445,127,0001,061,0002,113,536
2May 20, 2026 11:315,57457,095,35445,202,0001,063,0002,113,536
3May 20, 2026 11:315,59254,244,83145,398,0001,021,0002,113,536
4May 20, 2026 11:315,59456,042,24145,404,0001,034,0002,113,536
5May 20, 2026 11:315,59655,796,09345,424,0001,026,0002,113,536
6May 20, 2026 11:315,59856,147,78445,396,0001,075,0002,113,536
7May 20, 2026 11:315,59854,373,60045,409,0001,055,0002,113,536
8May 20, 2026 11:315,71857,392,22046,438,0001,023,0002,113,536
9May 20, 2026 11:315,79455,930,93747,066,0001,026,0002,113,536