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 20, 2026 11:48Victor MerckléVictor MerckléScore: 5,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 11:495,57254,028,46645,194,0001,061,0002,113,536
2May 20, 2026 11:495,59554,930,25145,391,0001,050,0002,113,536
3May 20, 2026 11:495,59856,283,21945,436,0001,032,0002,113,536
4May 20, 2026 11:495,60554,322,45345,501,0001,024,0002,113,536
5May 20, 2026 11:495,62457,480,62445,651,0001,031,0002,113,536
6May 20, 2026 11:495,62954,632,00545,597,0001,127,0002,113,536
7May 20, 2026 11:495,72257,113,63346,461,0001,034,0002,113,536
8May 20, 2026 11:495,74556,393,46946,587,0001,104,0002,113,536
9May 20, 2026 11:495,77557,250,14446,913,0001,026,0002,113,536