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 listOct 5, 2026 01:57FrederickFrederickScore: 8,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 01:588,59381,799,58969,286,0002,036,0002,117,632
2Oct 5, 2026 01:588,66483,105,37969,889,0002,026,0002,117,632
3Oct 5, 2026 01:588,66482,315,06869,903,0002,010,0002,117,632
4Oct 5, 2026 01:588,71183,419,99670,133,0002,173,0002,117,632
5Oct 5, 2026 01:588,76383,156,77370,702,0002,034,0002,117,632
6Oct 5, 2026 01:588,78984,151,56070,896,0002,060,0002,117,632
7Oct 5, 2026 01:588,83783,903,13871,348,0002,007,0002,117,632
8Oct 5, 2026 01:588,90984,367,29971,911,0002,040,0002,117,632
9Oct 5, 2026 01:589,00485,925,70672,679,0002,062,0002,117,632