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 19, 2026 07:01Victor MerckléVictor MerckléScore: 4,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 07:024,51344,968,44936,389,0001,075,0002,113,536
2Jun 19, 2026 07:024,52745,034,76636,506,0001,069,0002,113,536
3Jun 19, 2026 07:024,53645,084,85536,532,0001,124,0002,113,536
4Jun 19, 2026 07:024,53745,091,83936,636,0001,029,0002,113,536
5Jun 19, 2026 07:024,53845,318,98536,647,0001,024,0002,113,536
6Jun 19, 2026 07:024,54046,397,60436,652,0001,031,0002,113,536
7Jun 19, 2026 07:024,54045,115,52136,668,0001,017,0002,113,536
8Jun 19, 2026 07:024,54045,341,73436,686,0001,003,0002,113,536
9Jun 19, 2026 07:024,76347,179,51338,510,0001,023,0002,113,536