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 listJun 20, 2026 02:55Victor MerckléVictor MerckléScore: 48,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 02:5548,161407,197,695398,702,0001,038,0002,113,536
2Jun 20, 2026 02:5548,167407,312,355398,764,0001,026,0002,113,536
3Jun 20, 2026 02:5548,167407,247,528398,779,0001,015,0002,113,536
4Jun 20, 2026 02:5548,180407,379,021398,828,0001,070,0002,113,536
5Jun 20, 2026 02:5548,208407,735,739398,973,0001,158,0002,113,536
6Jun 20, 2026 02:5548,264408,213,226399,534,0001,063,0002,113,536
7Jun 20, 2026 02:5548,287408,240,720399,682,0001,102,0002,113,536
8Jun 20, 2026 02:5548,305408,423,126399,802,0001,133,0002,113,536
9Jun 20, 2026 02:5548,709411,718,722403,274,0001,012,0002,113,536