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 18, 2026 03:48Victor MerckléVictor MerckléScore: 4,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 03:494,54545,375,60436,666,0001,065,0002,113,536
2Jun 18, 2026 03:494,55445,910,40136,770,0001,032,0002,113,536
3Jun 18, 2026 03:494,73446,954,27138,227,0001,071,0002,113,536
4Jun 18, 2026 03:494,73746,923,81238,221,0001,097,0002,113,536
5Jun 18, 2026 03:494,73749,747,30038,242,0001,083,0002,113,536
6Jun 18, 2026 03:494,74447,028,23238,376,0001,002,0002,113,536
7Jun 18, 2026 03:494,74847,034,32738,391,0001,024,0002,113,536
8Jun 18, 2026 03:494,75247,151,10838,414,0001,033,0002,113,536
9Jun 18, 2026 03:494,75447,101,44438,454,0001,009,0002,113,536