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 12, 2026 07:05Victor MerckléVictor MerckléScore: 4,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 07:064,68447,304,17537,859,0001,020,0002,117,632stderr
2Aug 12, 2026 07:064,68847,301,63437,814,0001,097,0002,117,632stderr
3Aug 12, 2026 07:064,69347,109,09737,834,0001,122,0002,117,632stderr
4Aug 12, 2026 07:064,69547,126,16737,850,0001,126,0002,117,632stderr
5Aug 12, 2026 07:064,70748,725,96638,060,0001,014,0002,117,632stderr
6Aug 12, 2026 07:064,75047,815,22538,370,0001,058,0002,117,632stderr
7Aug 12, 2026 07:064,76347,679,05038,475,0001,063,0002,117,632stderr
8Aug 12, 2026 07:064,83948,354,99739,042,0001,122,0002,117,632stderr
9Aug 12, 2026 07:064,99849,869,06140,473,0001,012,0002,117,632stderr