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 23:03Victor MerckléVictor MerckléScore: 3,773Success
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 23:043,72439,329,72029,804,0001,110,0002,117,632stderr
2Aug 12, 2026 23:043,73639,477,89829,889,0001,125,0002,117,632stderr
3Aug 12, 2026 23:043,74839,570,42329,956,0001,154,0002,117,632stderr
4Aug 12, 2026 23:043,76039,626,00830,060,0001,149,0002,117,632stderr
5Aug 12, 2026 23:043,77339,739,91630,200,0001,123,0002,117,632stderr
6Aug 12, 2026 23:043,77639,777,93530,274,0001,071,0002,117,632stderr
7Aug 12, 2026 23:043,79839,971,82830,455,0001,073,0002,117,632stderr
8Aug 12, 2026 23:043,81640,151,86330,573,0001,104,0002,117,632stderr
9Aug 12, 2026 23:044,08542,422,69832,831,0001,075,0002,117,632stderr