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 10, 2026 15:29Oleg SkinderevOleg SkinderevScore: 72,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 15:2972,628630,169,552525,836,00076,976,0002,387,968
2Apr 10, 2026 15:2972,710632,179,274533,550,00069,941,0002,281,472
3Apr 10, 2026 15:2972,733628,296,923556,711,00046,975,0002,273,280
4Apr 10, 2026 15:2972,752630,679,265552,856,00050,986,0002,281,472
5Apr 10, 2026 15:2972,794635,498,976549,172,00055,017,0002,387,968
6Apr 10, 2026 15:2972,810631,662,909543,287,00061,032,0002,281,472