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 25, 2026 23:12Victor MerckléVictor MerckléScore: 5,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 23:135,20050,878,80542,056,0001,112,0002,113,536
2Jun 25, 2026 23:135,20950,914,29942,163,0001,078,0002,113,536
3Jun 25, 2026 23:135,21050,940,46642,153,0001,097,0002,113,536
4Jun 25, 2026 23:135,21651,016,15642,268,0001,026,0002,113,536
5Jun 25, 2026 23:135,22051,069,22642,255,0001,075,0002,113,536
6Jun 25, 2026 23:135,22351,073,53942,306,0001,053,0002,113,536
7Jun 25, 2026 23:135,23751,153,85242,366,0001,108,0002,113,536
8Jun 25, 2026 23:135,23752,445,77042,427,0001,047,0002,113,536
9Jun 25, 2026 23:135,24751,208,48042,482,0001,071,0002,113,536