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 16, 2026 02:18Victor MerckléVictor MerckléScore: 6,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 02:196,94964,976,25756,682,0001,001,0002,113,536
2May 16, 2026 02:196,95168,079,15457,695,00002,113,536
3May 16, 2026 02:196,95267,678,97256,664,0001,039,0002,113,536
4May 16, 2026 02:196,95267,160,42857,704,00002,113,536
5May 16, 2026 02:196,95368,082,17757,716,00002,113,536
6May 16, 2026 02:196,95767,055,89656,714,0001,032,0002,113,536
7May 16, 2026 02:196,96067,193,20956,757,0001,015,0002,113,536
8May 16, 2026 02:196,98865,380,24256,986,0001,017,0002,113,536
9May 16, 2026 02:197,09868,210,44258,916,00002,113,536