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 01:08Ondřej PolaneckýOndřej PolaneckýScore: 212,691Success
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 01:09211,9501,768,858,5131,758,002,0001,187,0002,117,632stderr
2Jul 19, 2026 01:09212,1001,770,092,1531,759,429,0001,004,0002,117,632stderr
3Jul 19, 2026 01:09212,1651,770,601,6771,759,706,0001,269,0002,117,632stderr
4Jul 19, 2026 01:09212,3931,772,585,8211,761,862,0001,001,0002,117,632stderr
5Jul 19, 2026 01:09212,6911,775,027,4631,764,339,0001,002,0002,117,632stderr
6Jul 19, 2026 01:09212,8051,776,084,7191,765,281,0001,005,0002,117,632stderr
7Jul 19, 2026 01:09212,8261,776,190,2631,765,463,0001,001,0002,117,632stderr
8Jul 19, 2026 01:09212,9451,777,178,2421,766,447,0001,000,0002,117,632stderr
9Jul 19, 2026 01:09212,9961,777,499,2941,766,864,0001,003,0002,117,632stderr