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 12:16Victor MerckléVictor MerckléScore: 10,838Success
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 12:1710,76697,740,88888,347,0001,014,0002,117,632stderr
2Aug 25, 2026 12:1710,76997,767,44788,366,0001,018,0002,117,632stderr
3Aug 25, 2026 12:1710,78997,929,46188,538,0001,013,0002,117,632stderr
4Aug 25, 2026 12:1710,78997,949,75388,517,0001,034,0002,117,632stderr
5Aug 25, 2026 12:1710,83898,322,51188,828,0001,130,0002,117,632stderr
6Aug 25, 2026 12:1710,86498,502,47789,156,0001,018,0002,117,632stderr
7Aug 25, 2026 12:1710,86998,844,39889,079,0001,137,0002,117,632stderr
8Aug 25, 2026 12:1710,87998,648,64789,290,0001,012,0002,117,632stderr
9Aug 25, 2026 12:1710,95099,214,79689,872,0001,020,0002,117,632stderr