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 listOct 21, 2025 22:57hochohochoScore: 2,065,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2025 22:572,064,54217,171,548,38817,060,737,00074,959,0002,277,376
2Oct 21, 2025 22:572,064,65917,180,246,48817,076,698,00059,970,0002,277,376
3Oct 21, 2025 22:572,064,69217,170,150,57817,066,978,00069,963,0002,289,664
4Oct 21, 2025 22:572,064,90217,174,593,17817,077,720,00060,970,0002,277,376
5Oct 21, 2025 22:572,065,39617,174,463,12517,076,817,00065,972,0002,277,376
6Oct 21, 2025 22:572,065,89017,178,767,34617,089,912,00056,973,0002,277,376
7Oct 21, 2025 22:572,066,97017,188,090,58317,069,892,00085,959,0002,277,376
8Oct 21, 2025 22:572,067,26417,189,361,18217,089,319,00068,973,0002,277,376
9Oct 21, 2025 22:572,070,88717,219,833,77917,116,395,00071,963,0002,277,376