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 10, 2026 17:27Victor MerckléVictor MerckléScore: 4,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 17:294,17643,430,62533,643,0001,018,0002,117,632stderr
2Aug 10, 2026 17:294,19843,055,94533,737,0001,111,0002,117,632stderr
3Aug 10, 2026 17:294,20043,024,94433,740,0001,125,0002,117,632stderr
4Aug 10, 2026 17:294,20043,268,93233,738,0001,122,0002,117,632stderr
5Aug 10, 2026 17:294,20643,339,18233,806,0001,106,0002,117,632stderr
6Aug 10, 2026 17:294,21443,172,05133,953,0001,026,0002,117,632stderr
7Aug 10, 2026 17:294,23043,388,69334,006,0001,108,0002,117,632stderr
8Aug 10, 2026 17:294,23343,347,88034,122,0001,019,0002,117,632stderr
9Aug 10, 2026 17:294,24443,694,78434,123,0001,110,0002,117,632stderr