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 17, 2026 04:13Kevin HeaveyKevin HeaveyScore: 4,006Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 04:233,75740,991,01430,138,0001,051,0002,113,536
2Jul 17, 2026 04:233,76341,068,52130,189,0001,047,0002,113,536
3Jul 17, 2026 04:233,76842,093,13630,230,0001,052,0002,113,536
4Jul 17, 2026 04:233,97742,876,25931,959,0001,052,0002,113,536
5Jul 17, 2026 04:234,00643,014,02832,210,0001,047,0002,113,536
6Jul 17, 2026 04:234,02843,296,63932,389,0001,044,0002,113,536
7Jul 17, 2026 04:234,07043,652,54732,741,0001,044,0002,113,536
8Jul 17, 2026 04:234,07343,656,37232,763,0001,045,0002,113,536
9Jul 17, 2026 04:234,08143,663,42232,828,0001,046,0002,113,536