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 listJul 1, 2026 07:31Genos0Genos0Score: 79,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 07:3178,944664,829,094588,988,00066,252,0002,113,536
2Jul 1, 2026 07:3178,963664,737,762588,769,00066,630,0002,113,536
3Jul 1, 2026 07:3179,120666,857,583589,186,00067,515,0002,113,536
4Jul 1, 2026 07:3179,120666,105,272589,417,00067,281,0002,113,536
5Jul 1, 2026 07:3179,123667,548,709589,307,00067,420,0002,113,536
6Jul 1, 2026 07:3179,196666,643,839589,254,00068,077,0002,113,536
7Jul 1, 2026 07:3179,603670,154,234589,396,00071,316,0002,113,536
8Jul 1, 2026 07:3180,063673,900,178593,835,00070,693,0002,113,536
9Jul 1, 2026 07:3180,114674,323,179594,284,00070,670,0002,113,536