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 24, 2026 20:36Victor MerckléVictor MerckléScore: 3,883Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 20:373,83140,479,25430,701,0001,098,0002,117,632stderr
2Aug 24, 2026 20:373,86341,018,98130,981,0001,084,0002,117,632stderr
3Aug 24, 2026 20:373,86440,498,62930,942,0001,136,0002,117,632stderr
4Aug 24, 2026 20:373,87940,589,12931,047,0001,151,0002,117,632stderr
5Aug 24, 2026 20:373,88341,282,76331,063,0001,168,0002,117,632stderr
6Aug 24, 2026 20:373,91040,895,41331,319,0001,134,0002,117,632stderr
7Aug 24, 2026 20:373,96341,246,95931,753,0001,141,0002,117,632stderr
8Aug 24, 2026 20:374,02041,791,13032,273,0001,100,0002,117,632stderr
9Aug 24, 2026 20:374,02142,213,26132,294,0001,084,0002,117,632stderr