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 12, 2026 17:23Yash ShahYash ShahScore: 2,067,419Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 17:232,064,10017,168,452,47917,067,054,00064,973,0002,273,280
2Apr 12, 2026 17:232,065,69717,175,404,02517,069,327,00075,961,0002,281,472
3Apr 12, 2026 17:232,066,13717,175,144,83317,070,967,00077,967,0002,293,760
4Apr 12, 2026 17:232,066,89917,190,684,41317,082,297,00072,962,0002,281,472
5Apr 12, 2026 17:232,067,41917,188,829,21517,078,614,00080,964,0002,285,568
6Apr 12, 2026 17:232,068,05717,196,078,79817,101,900,00062,973,0002,281,472
7Apr 12, 2026 17:232,068,39917,202,659,90517,098,747,00068,966,0002,281,472
8Apr 12, 2026 17:232,073,70217,240,572,88517,160,746,00050,978,0002,281,472
9Apr 12, 2026 17:232,076,39117,268,046,30317,178,071,00055,977,0002,281,472