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 2, 2026 11:49Karthik ReddyKarthik ReddyScore: 3,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 11:503,5733,038,694,24929,659,000020,480
2Oct 2, 2026 11:503,5743,038,682,36029,668,000020,480
3Oct 2, 2026 11:503,5803,038,878,83129,719,000020,480
4Oct 2, 2026 11:503,5833,038,863,84229,739,000020,480
5Oct 2, 2026 11:503,5843,038,861,36329,749,000020,480
6Oct 2, 2026 11:503,5883,038,893,22729,786,000020,480
7Oct 2, 2026 11:503,5893,038,911,96029,793,000020,480
8Oct 2, 2026 11:503,5903,038,881,29129,801,000020,480
9Oct 2, 2026 11:503,6003,039,098,93629,880,000020,480