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 listApr 21, 2026 02:57Adewuyi IsraelAdewuyi IsraelScore: 2,068,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 03:002,068,09617,198,740,21617,097,232,00067,969,0002,260,992
2Apr 21, 2026 03:002,068,20717,202,568,25217,087,156,00078,963,0002,260,992
3Apr 21, 2026 03:002,068,55217,196,711,93317,096,014,00072,970,0002,265,088
4Apr 21, 2026 03:002,068,86917,211,757,98617,100,650,00070,965,0002,260,992
5Apr 21, 2026 03:002,068,94317,204,779,20717,115,259,00056,970,0002,260,992
6Apr 21, 2026 03:002,069,29117,205,098,81317,107,159,00067,964,0002,260,992
7Apr 21, 2026 03:002,069,36217,211,728,82817,104,746,00070,965,0002,494,464
8Apr 21, 2026 03:002,069,64617,212,352,79017,109,099,00068,968,0002,260,992
9Apr 21, 2026 03:002,071,48017,224,672,76217,115,330,00077,960,0002,494,464