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 18, 2026 12:37Kevin HeaveyKevin HeaveyScore: 3,839Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 13:033,63839,918,54529,158,0001,041,0002,117,632
2Jul 18, 2026 13:033,64440,028,75429,030,0001,220,0002,117,632
3Jul 18, 2026 13:033,69140,473,55729,391,0001,246,0002,117,632
4Jul 18, 2026 13:033,78241,079,68030,181,0001,214,0002,117,632
5Jul 18, 2026 13:033,83941,570,29130,659,0001,209,0002,117,632
6Jul 18, 2026 13:033,85641,740,67830,969,0001,039,0002,117,632
7Jul 18, 2026 13:033,86841,816,58130,912,0001,199,0002,117,632
8Jul 18, 2026 13:033,88142,002,07531,002,0001,215,0002,117,632
9Jul 18, 2026 13:033,90242,047,76031,165,0001,223,0002,117,632