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:15Victor MerckléVictor MerckléScore: 5,188Success
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:155,03350,015,83540,636,0001,144,0002,117,632stderr
2Aug 10, 2026 11:155,05750,338,50240,855,0001,126,0002,117,632stderr
3Aug 10, 2026 11:155,08551,671,65941,173,0001,034,0002,117,632stderr
4Aug 10, 2026 11:155,14451,032,85341,665,0001,036,0002,117,632stderr
5Aug 10, 2026 11:155,18851,441,59042,028,0001,034,0002,117,632stderr
6Aug 10, 2026 11:155,20051,418,27742,133,0001,032,0002,117,632stderr
7Aug 10, 2026 11:155,20551,485,27742,181,0001,024,0002,117,632stderr
8Aug 10, 2026 11:155,22151,709,75142,309,0001,032,0002,117,632stderr
9Aug 10, 2026 11:155,23352,424,65842,405,0001,037,0002,117,632stderr