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 16, 2026 18:43KacpxerKacpxerScore: 5,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 18:465,67757,843,97545,992,0001,134,0002,113,536
2Oct 16, 2026 18:465,68457,906,46245,974,0001,211,0002,113,536
3Oct 16, 2026 18:465,70658,062,41746,246,0001,117,0002,113,536
4Oct 16, 2026 18:465,76358,636,24346,694,0001,140,0002,113,536
5Oct 16, 2026 18:465,76859,208,03846,750,0001,131,0002,113,536
6Oct 16, 2026 18:465,76958,577,53846,741,0001,142,0002,113,536
7Oct 16, 2026 18:465,82959,711,90247,252,0001,132,0002,113,536
8Oct 16, 2026 18:465,87160,518,47647,617,0001,116,0002,113,536
9Oct 16, 2026 18:465,98960,413,92648,571,0001,141,0002,113,536