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 listMay 9, 2026 23:56Andrii StolitniiAndrii StolitniiScore: 85,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 23:5685,690729,318,506651,476,00059,755,0002,359,296
2May 9, 2026 23:5685,791729,781,134650,644,00061,422,0002,367,488
3May 9, 2026 23:5685,800731,624,219651,660,00060,480,0002,359,296
4May 9, 2026 23:5685,823729,687,095650,866,00061,468,0002,351,104
5May 9, 2026 23:5685,827729,100,579650,928,00061,438,0002,351,104
6May 9, 2026 23:5685,857726,967,743652,265,00060,356,0002,359,296
7May 9, 2026 23:5685,878727,979,729651,881,00060,913,0002,355,200
8May 9, 2026 23:5685,880727,781,034652,490,00060,318,0002,363,392
9May 9, 2026 23:5685,889728,994,384652,300,00060,584,0002,363,392