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 11:21Victor MerckléVictor MerckléScore: 4,943Success
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 11:214,88348,826,58139,390,0001,141,0002,117,632stderr
2Aug 10, 2026 11:214,89848,996,79139,534,0001,125,0002,117,632stderr
3Aug 10, 2026 11:214,90049,053,72139,528,0001,147,0002,117,632stderr
4Aug 10, 2026 11:214,91749,124,04739,782,0001,033,0002,117,632stderr
5Aug 10, 2026 11:214,94349,365,22739,998,0001,036,0002,117,632stderr
6Aug 10, 2026 11:214,95749,489,22040,106,0001,039,0002,117,632stderr
7Aug 10, 2026 11:214,96051,455,34440,137,0001,036,0002,117,632stderr
8Aug 10, 2026 11:214,96049,525,48740,140,0001,028,0002,117,632stderr
9Aug 10, 2026 11:214,99149,852,28540,378,0001,049,0002,117,632stderr