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 5, 2026 16:46flavio87flavio87Score: 18,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 16:4718,039165,879,173148,717,0001,009,0002,359,296
2May 5, 2026 16:4718,109168,346,345149,296,0001,010,0002,367,488
3May 5, 2026 16:4718,256165,788,010150,524,0001,009,0002,351,104
4May 5, 2026 16:4718,282168,440,396150,735,0001,010,0002,379,776
5May 5, 2026 16:4718,312169,273,350150,983,0001,010,0002,367,488
6May 5, 2026 16:4718,443169,735,919152,068,0001,010,0002,371,584
7May 5, 2026 16:4718,473169,989,271152,318,0001,009,0002,363,392
8May 5, 2026 16:4718,640170,796,720153,705,0001,009,0002,367,488
9May 5, 2026 16:4718,717172,768,864154,345,0001,009,0002,359,296