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 listMar 2, 2026 11:57lrexerlrexerScore: 191,735Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 11:57191,5751,612,635,5231,521,116,00068,959,0002,281,472
2Mar 2, 2026 11:57191,6221,612,471,0001,524,488,00065,977,0002,289,664
3Mar 2, 2026 11:57191,6231,617,562,6241,524,494,00065,978,0002,367,488
4Mar 2, 2026 11:57191,6541,620,524,4251,521,740,00068,988,0002,289,664
5Mar 2, 2026 11:57191,7351,615,270,9651,527,427,00063,976,0002,281,472
6Mar 2, 2026 11:57191,7881,620,423,0441,529,888,00061,954,0002,281,472
7Mar 2, 2026 11:57191,9381,619,980,6731,521,129,00071,958,0002,293,760
8Mar 2, 2026 11:57194,9051,644,586,9411,559,726,00057,989,0002,281,472
9Mar 2, 2026 11:57196,3401,654,888,8081,558,641,00070,983,0002,281,472