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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 10:174,73147,615,44438,180,0001,088,0002,117,632stderr
2Aug 1, 2026 10:174,74047,739,06138,253,0001,097,0002,117,632stderr
3Aug 1, 2026 10:174,74647,816,09838,292,0001,107,0002,117,632stderr
4Aug 1, 2026 10:174,75248,601,37038,348,0001,094,0002,117,632stderr
5Aug 1, 2026 10:174,76247,933,31538,429,0001,099,0002,117,632stderr
6Aug 1, 2026 10:174,77247,983,33438,526,0001,084,0002,117,632stderr
7Aug 1, 2026 10:174,79148,107,36938,766,0001,003,0002,117,632stderr
8Aug 1, 2026 10:174,79148,224,58638,691,0001,078,0002,117,632stderr
9Aug 1, 2026 10:174,81148,285,61038,925,0001,014,0002,117,632stderr