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 listAug 2, 2026 15:13TonyTonyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 15:140194,232,136127,002,00057,271,0002,113,536expected "53683645374888778 ", got "53683988568642322 "
2Aug 2, 2026 15:1422,600197,422,619130,388,00057,193,0002,113,536
3Aug 2, 2026 15:1422,794199,106,375132,554,00056,641,0002,113,536
4Aug 2, 2026 15:1422,892199,871,379132,199,00057,805,0002,113,536
5Aug 2, 2026 15:1423,019200,912,752132,966,00058,097,0002,113,536
6Aug 2, 2026 15:1423,046201,196,525133,222,00058,063,0002,113,536
7Aug 2, 2026 15:1423,078201,447,869134,156,00057,392,0002,113,536
8Aug 2, 2026 15:1423,196202,350,419132,723,00059,812,0002,113,536
9Aug 2, 2026 15:1423,414204,205,176137,552,00056,790,0002,113,536