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 listDec 17, 2025 11:06ajccostaajccostaScore: 2,066,048Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2025 11:062,064,68617,167,926,65117,070,919,00065,972,0002,277,376
2Dec 17, 2025 11:062,065,07217,169,903,42817,071,133,00068,968,0002,285,568
3Dec 17, 2025 11:062,065,54717,174,030,43517,073,065,00070,971,0002,289,664
4Dec 17, 2025 11:062,065,55717,179,924,03317,076,147,00067,972,0002,289,664
5Dec 17, 2025 11:062,066,04817,182,426,85817,081,224,00066,973,0002,269,184
6Dec 17, 2025 11:062,066,79717,187,390,17717,094,440,00059,973,0002,277,376
7Dec 17, 2025 11:062,066,99517,191,778,42417,077,093,00078,963,0002,277,376
8Dec 17, 2025 11:062,068,01117,194,887,39717,094,522,00069,969,0002,277,376
9Dec 17, 2025 11:062,087,15617,352,601,16817,247,427,00075,966,0002,277,376