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 5, 2026 21:17Kevin HeaveyKevin HeaveyScore: 20,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 21:1820,592180,469,548169,913,0001,008,0002,121,728stderr
2Jul 5, 2026 21:1820,703181,326,640170,634,0001,201,0002,121,728stderr
3Jul 5, 2026 21:1820,748181,744,906171,023,0001,188,0002,121,728stderr
4Jul 5, 2026 21:1820,781181,988,343171,289,0001,196,0002,121,728stderr
5Jul 5, 2026 21:1820,794182,098,066171,399,0001,196,0002,121,728stderr
6Jul 5, 2026 21:1820,796183,542,439171,604,0001,010,0002,121,728stderr
7Jul 5, 2026 21:1820,805182,155,845171,488,0001,194,0002,121,728stderr
8Jul 5, 2026 21:1820,876182,839,707172,266,0001,013,0002,121,728stderr
9Jul 5, 2026 21:1821,572188,646,865178,030,0001,019,0002,121,728stderr