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 listOct 1, 2026 08:00Karthik ReddyKarthik ReddyScore: 3,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 08:013,36636,990,81026,853,0001,089,0002,113,536
2Oct 1, 2026 08:013,36840,006,95226,865,0001,096,0002,113,536
3Oct 1, 2026 08:013,37236,915,94426,854,0001,135,0002,113,536
4Oct 1, 2026 08:013,37336,995,36826,892,0001,111,0002,113,536
5Oct 1, 2026 08:013,37737,060,84726,849,0001,181,0002,113,536
6Oct 1, 2026 08:013,39837,217,04327,117,0001,092,0002,113,536
7Oct 1, 2026 08:013,40337,215,37327,080,0001,170,0002,113,536
8Oct 1, 2026 08:013,42037,443,80127,218,0001,175,0002,113,536
9Oct 1, 2026 08:013,42337,413,26127,239,0001,175,0002,113,536