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 00:47cashkarucashkaruScore: 2,068,718Success
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 00:502,060,91817,141,682,36517,035,656,00069,969,0002,260,992
2Apr 21, 2026 00:502,068,06317,198,646,98117,087,963,00076,968,0002,260,992
3Apr 21, 2026 00:502,068,07217,197,637,45217,102,035,00062,966,0002,260,992
4Apr 21, 2026 00:502,068,64317,199,685,46717,100,771,00068,970,0002,260,992
5Apr 21, 2026 00:502,068,71817,202,546,00717,109,396,00060,965,0002,502,656
6Apr 21, 2026 00:502,072,44817,237,727,62417,135,355,00065,970,0002,260,992
7Apr 21, 2026 00:502,072,66617,242,679,73117,141,165,00061,968,0002,273,280
8Apr 21, 2026 00:502,079,64317,301,668,00317,213,060,00047,980,0002,490,368
9Apr 21, 2026 00:502,125,52117,675,620,16217,565,865,00075,964,0002,260,992