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:40lrexerlrexerScore: 2,067,745Success
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:402,065,44817,176,925,03717,076,248,00066,969,0002,281,472
2Mar 2, 2026 11:402,065,86717,176,360,13317,079,724,00066,971,0002,289,664
3Mar 2, 2026 11:402,066,21717,182,698,82817,082,630,00066,967,0002,289,664
4Mar 2, 2026 11:402,067,72917,192,060,54117,089,182,00072,966,0002,523,136
5Mar 2, 2026 11:402,067,74517,196,877,47617,093,316,00068,968,0002,281,472
6Mar 2, 2026 11:402,069,21517,205,460,80717,129,503,00044,980,0002,281,472
7Mar 2, 2026 11:402,073,64117,244,739,20317,142,250,00068,968,0002,293,760
8Mar 2, 2026 11:402,097,80317,442,471,11817,338,800,00072,969,0002,281,472
9Mar 2, 2026 11:402,243,71818,661,877,12018,554,894,00067,966,0002,293,760