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 9, 2026 09:33Oleg SkinderevOleg SkinderevScore: 2,067,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2026 09:332,065,19317,174,359,33117,071,136,00069,963,0002,265,088
2Apr 9, 2026 09:332,066,19117,181,207,12717,072,420,00076,965,0002,289,664
3Apr 9, 2026 09:332,067,06517,195,525,73917,100,671,00055,972,0002,281,472
4Apr 9, 2026 09:332,067,10417,185,100,78517,087,994,00068,971,0002,289,664
5Apr 9, 2026 09:332,067,86017,195,193,47717,109,266,00053,972,0002,293,760
6Apr 9, 2026 09:332,068,26617,202,901,90117,093,642,00072,968,0002,289,664
7Apr 9, 2026 09:332,069,45717,206,609,07117,096,524,00079,965,0002,281,472
8Apr 9, 2026 09:332,070,56217,219,727,11317,097,715,00087,947,0002,281,472
9Apr 9, 2026 09:332,076,76717,276,683,16017,159,210,00077,955,0002,293,760