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 12, 2026 12:47Kevin HeaveyKevin HeaveyScore: 5,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 12:485,02251,441,44140,473,0001,216,0002,117,632
2Jul 12, 2026 12:485,02851,316,59640,534,0001,206,0002,117,632
3Jul 12, 2026 12:485,02851,446,68340,506,0001,231,0002,117,632
4Jul 12, 2026 12:485,03551,406,10040,770,0001,025,0002,117,632
5Jul 12, 2026 12:485,04151,481,28040,830,0001,013,0002,117,632
6Jul 12, 2026 12:485,04151,512,50740,807,0001,034,0002,117,632
7Jul 12, 2026 12:485,22052,955,35442,294,0001,033,0002,117,632
8Jul 12, 2026 12:485,30953,689,10642,859,0001,212,0002,117,632
9Jul 12, 2026 12:485,34454,039,54743,132,0001,231,0002,117,632