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 listNov 4, 2025 04:11Tejas G.Tejas G.Score: 10,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 04:1110,839112,337,89687,961,0001,999,0002,285,568
2Nov 4, 2025 04:1110,842112,581,60188,988,000999,0002,519,040
3Nov 4, 2025 04:1110,856114,073,97188,106,0002,002,0002,285,568
4Nov 4, 2025 04:1110,860110,080,64188,138,0002,003,0002,379,776
5Nov 4, 2025 04:1110,919120,745,62189,632,000995,0002,523,136
6Nov 4, 2025 04:1110,940119,188,33588,810,0001,995,0002,285,568
7Nov 4, 2025 04:1110,946119,406,18689,857,000998,0002,285,568
8Nov 4, 2025 04:1111,092114,559,26890,060,0002,001,0002,285,568
9Nov 4, 2025 04:1111,131120,943,53590,403,0001,986,0002,506,752
10Nov 4, 2025 04:1111,142114,231,80791,471,0001,005,0002,285,568
11Nov 4, 2025 04:1111,143119,548,83391,485,0001,005,0002,506,752
12Nov 4, 2025 04:1111,158121,942,85591,605,0001,006,0002,519,040