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 25, 2026 23:00Victor MerckléVictor MerckléScore: 4,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 23:014,68747,283,70437,871,0001,038,0002,117,632stderr
2Aug 25, 2026 23:014,70447,482,11638,009,0001,041,0002,117,632stderr
3Aug 25, 2026 23:014,72047,542,12038,172,0001,006,0002,117,632stderr
4Aug 25, 2026 23:014,72747,715,44638,130,0001,110,0002,117,632stderr
5Aug 25, 2026 23:014,74548,191,42338,370,0001,015,0002,117,632stderr
6Aug 25, 2026 23:014,75547,874,16438,450,0001,024,0002,117,632stderr
7Aug 25, 2026 23:014,77549,177,74138,618,0001,019,0002,117,632stderr
8Aug 25, 2026 23:014,83048,511,77139,068,0001,025,0002,117,632stderr
9Aug 25, 2026 23:014,89449,069,64839,601,0001,023,0002,117,632stderr