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 18, 2026 23:16Aleksei ShahoikaAleksei ShahoikaScore: 11,488Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 23:1611,420104,999,16473,416,00021,371,0002,113,536
2May 18, 2026 23:1611,440106,504,53473,476,00021,480,0002,113,536
3May 18, 2026 23:1611,461106,623,24673,579,00021,549,0002,113,536
4May 18, 2026 23:1611,473106,652,25473,478,00021,749,0002,113,536
5May 18, 2026 23:1611,488104,759,13573,431,00021,927,0002,113,536
6May 18, 2026 23:1611,501106,639,57774,293,00021,173,0002,113,536
7May 18, 2026 23:1611,524105,053,98073,398,00022,256,0002,113,536
8May 18, 2026 23:1611,532107,031,39373,742,00021,976,0002,113,536
9May 18, 2026 23:1611,660107,957,72373,473,00023,306,0002,113,536