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 26, 2026 05:39poyo180605poyo180605Score: 2,069,082Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 05:392,063,37217,158,314,43917,059,018,00066,972,0002,281,472
2Mar 26, 2026 05:392,067,66617,194,693,48517,089,661,00071,964,0002,281,472
3Mar 26, 2026 05:392,068,91217,203,363,71817,093,008,00078,963,0002,523,136
4Mar 26, 2026 05:392,068,97517,206,320,88317,090,525,00081,964,0002,281,472
5Mar 26, 2026 05:392,069,08217,208,825,60017,093,423,00079,955,0002,281,472
6Mar 26, 2026 05:392,069,13417,209,500,80217,110,840,00062,973,0002,519,040
7Mar 26, 2026 05:392,069,38217,204,303,99517,103,898,00071,970,0002,281,472
8Mar 26, 2026 05:392,072,34117,240,165,62817,135,459,00064,975,0002,281,472
9Mar 26, 2026 05:392,074,34317,247,841,57317,153,084,00063,966,0002,281,472