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 listFeb 26, 2026 12:12Genos0Genos0Score: 2,066,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 12:122,058,06017,111,433,43017,013,929,00067,971,0002,281,472
2Feb 26, 2026 12:122,064,04717,169,796,39717,053,623,00077,966,0002,281,472
3Feb 26, 2026 12:122,064,51417,172,184,31517,077,491,00057,974,0002,281,472
4Feb 26, 2026 12:122,064,91817,174,704,11717,070,857,00067,963,0002,281,472
5Feb 26, 2026 12:122,066,10617,190,150,09417,083,708,00064,968,0002,281,472
6Feb 26, 2026 12:122,068,02217,199,057,99217,110,606,00053,976,0002,265,088
7Feb 26, 2026 12:122,068,20417,201,624,00117,109,115,00056,977,0002,281,472
8Feb 26, 2026 12:122,068,47017,203,851,30517,104,330,00063,975,0002,265,088
9Feb 26, 2026 12:122,071,30317,220,390,44917,129,842,00061,974,0002,293,760