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 24, 2026 21:28Victor MerckléVictor MerckléScore: 4,500Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 21:294,49145,054,99336,174,0001,104,0002,113,536
2Jun 24, 2026 21:294,49244,866,80436,204,0001,082,0002,113,536
3Jun 24, 2026 21:294,49244,889,82236,169,0001,116,0002,113,536
4Jun 24, 2026 21:294,50044,975,45636,276,0001,075,0002,113,536
5Jun 24, 2026 21:294,50044,938,55736,272,0001,078,0002,113,536
6Jun 24, 2026 21:294,50644,966,81336,290,0001,110,0002,113,536
7Jun 24, 2026 21:294,51046,397,48536,322,0001,111,0002,113,536
8Jun 24, 2026 21:294,51945,016,12636,417,0001,096,0002,113,536
9Jun 24, 2026 21:294,58445,519,12936,943,0001,106,0002,113,536