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 listAug 28, 2026 19:09Victor MerckléVictor MerckléScore: 6,149Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:106,11059,700,75949,696,0001,017,0002,117,632stderr
2Aug 28, 2026 19:106,12959,919,01749,855,0001,022,0002,117,632stderr
3Aug 28, 2026 19:106,13659,884,63149,903,0001,031,0002,117,632stderr
4Aug 28, 2026 19:106,14660,060,74149,997,0001,017,0002,117,632stderr
5Aug 28, 2026 19:106,14960,153,63750,022,0001,020,0002,117,632stderr
6Aug 28, 2026 19:106,15059,316,32950,011,0001,036,0002,117,632stderr
7Aug 28, 2026 19:106,16559,347,74450,144,0001,033,0002,117,632stderr
8Aug 28, 2026 19:106,19160,386,60250,358,0001,028,0002,117,632stderr
9Aug 28, 2026 19:106,24360,849,25150,803,0001,018,0002,117,632stderr