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 listMay 17, 2026 19:41Victor MerckléVictor MerckléScore: 6,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 19:426,95567,218,54056,675,0001,053,0002,113,536
2May 17, 2026 19:426,95767,421,25756,707,0001,040,0002,113,536
3May 17, 2026 19:426,95867,463,03356,734,0001,019,0002,113,536
4May 17, 2026 19:426,96567,076,11656,740,0001,077,0002,113,536
5May 17, 2026 19:426,96566,320,18456,739,0001,074,0002,113,536
6May 17, 2026 19:426,96765,754,92156,763,0001,065,0002,113,536
7May 17, 2026 19:427,07768,664,48057,689,0001,055,0002,113,536
8May 17, 2026 19:427,11066,819,25857,926,0001,087,0002,113,536
9May 17, 2026 19:427,13966,988,54158,178,0001,076,0002,113,536