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 listDec 31, 2025 05:22Josu San MartinJosu San MartinScore: 54,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 05:2254,683478,475,917451,866,0001,999,0002,265,088
2Dec 31, 2025 05:2254,725480,171,062453,216,0001,000,0002,293,760
3Dec 31, 2025 05:2254,892483,373,765453,608,0001,998,0002,293,760