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 27, 2026 00:20Victor MerckléVictor MerckléScore: 4,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 00:204,09842,431,43332,865,0001,150,0002,117,632stderr
2Aug 27, 2026 00:204,11342,506,27533,048,0001,093,0002,117,632stderr
3Aug 27, 2026 00:204,11642,512,31733,080,0001,085,0002,117,632stderr
4Aug 27, 2026 00:204,12243,897,33233,075,0001,139,0002,117,632stderr
5Aug 27, 2026 00:204,13442,724,60633,228,0001,092,0002,117,632stderr
6Aug 27, 2026 00:204,13742,714,94133,241,0001,097,0002,117,632stderr
7Aug 27, 2026 00:204,14042,735,54933,250,0001,116,0002,117,632stderr
8Aug 27, 2026 00:204,16743,620,41833,437,0001,150,0002,117,632stderr
9Aug 27, 2026 00:204,18043,063,65133,569,0001,125,0002,117,632stderr