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 28, 2026 19:01Victor MerckléVictor MerckléScore: 6,053Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:036,00058,193,14548,791,0001,017,0002,117,632stderr
2Aug 28, 2026 19:036,00158,751,02048,798,0001,015,0002,117,632stderr
3Aug 28, 2026 19:036,01258,931,76748,865,0001,036,0002,117,632stderr
4Aug 28, 2026 19:036,01758,918,20948,927,0001,017,0002,117,632stderr
5Aug 28, 2026 19:036,05359,287,32849,225,0001,017,0002,117,632stderr
6Aug 28, 2026 19:036,08659,548,96249,504,0001,016,0002,117,632stderr
7Aug 28, 2026 19:036,09258,938,68949,545,0001,019,0002,117,632stderr
8Aug 28, 2026 19:036,10359,687,29549,642,0001,018,0002,117,632stderr
9Aug 28, 2026 19:036,10459,672,20449,637,0001,027,0002,117,632stderr