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 22:17Victor MerckléVictor MerckléScore: 22,505Success
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 22:1822,479194,004,232185,531,0001,045,0002,113,536
2Jun 18, 2026 22:1822,486194,243,911185,603,0001,033,0002,113,536
3Jun 18, 2026 22:1822,492194,312,420185,680,0001,009,0002,113,536
4Jun 18, 2026 22:1822,499194,714,372185,674,0001,071,0002,113,536
5Jun 18, 2026 22:1822,505194,469,341185,767,0001,028,0002,113,536
6Jun 18, 2026 22:1822,566195,028,072186,247,0001,053,0002,113,536
7Jun 18, 2026 22:1822,772196,696,071187,941,0001,074,0002,113,536
8Jun 18, 2026 22:1822,973198,285,535189,603,0001,075,0002,113,536
9Jun 18, 2026 22:1822,975198,681,916189,618,0001,081,0002,113,536