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 listJul 19, 2026 11:58Ondřej PolaneckýOndřej PolaneckýScore: 384,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 11:58383,2313,190,436,5803,179,642,0001,178,0002,117,632stderr
2Jul 19, 2026 11:58384,2263,198,745,2503,187,861,0001,222,0002,117,632stderr
3Jul 19, 2026 11:58384,3073,199,403,0793,188,585,0001,164,0002,117,632stderr
4Jul 19, 2026 11:58384,3963,200,289,8863,189,490,0001,001,0002,117,632stderr
5Jul 19, 2026 11:58384,4453,200,592,7333,189,732,0001,167,0002,117,632stderr
6Jul 19, 2026 11:58410,7943,420,016,9433,408,424,0001,174,0002,117,632stderr
7Jul 19, 2026 11:58411,2453,423,225,6113,412,334,0001,006,0002,117,632stderr
8Jul 19, 2026 11:58411,2903,423,729,1173,411,595,0002,113,0002,117,632stderr
9Jul 19, 2026 11:58411,2933,423,330,7983,412,555,0001,185,0002,117,632stderr