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 listJun 29, 2026 01:11Victor MerckléVictor MerckléScore: 4,160Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 01:124,12942,000,95533,174,0001,102,0002,117,632stderr
2Jun 29, 2026 01:124,13942,085,38333,261,0001,099,0002,117,632stderr
3Jun 29, 2026 01:124,14842,356,67533,332,0001,103,0002,117,632stderr
4Jun 29, 2026 01:124,15642,181,88033,476,0001,020,0002,117,632stderr
5Jun 29, 2026 01:124,16043,911,85433,420,0001,115,0002,117,632stderr
6Jun 29, 2026 01:124,17442,386,16133,580,0001,069,0002,117,632stderr
7Jun 29, 2026 01:124,17542,361,09233,552,0001,105,0002,117,632stderr
8Jun 29, 2026 01:124,20242,647,00233,761,0001,116,0002,117,632stderr
9Jun 29, 2026 01:124,41044,372,00935,542,0001,065,0002,117,632stderr