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 23, 2026 16:58Victor MerckléVictor MerckléScore: 4,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 16:594,60446,548,08437,092,0001,125,0002,117,632stderr
2Aug 23, 2026 16:594,61346,397,98837,178,0001,110,0002,117,632stderr
3Aug 23, 2026 16:594,61646,534,52237,180,0001,133,0002,117,632stderr
4Aug 23, 2026 16:594,62246,752,56537,254,0001,112,0002,117,632stderr
5Aug 23, 2026 16:594,63046,801,63937,350,0001,083,0002,117,632stderr
6Aug 23, 2026 16:594,72648,339,39838,132,0001,101,0002,117,632stderr
7Aug 23, 2026 16:594,73547,500,72538,174,0001,129,0002,117,632stderr
8Aug 23, 2026 16:594,74647,626,81738,257,0001,135,0002,117,632stderr
9Aug 23, 2026 16:594,92349,016,64539,837,0001,026,0002,117,632stderr