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 listMay 12, 2026 02:06cashkarucashkaruScore: 46,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 02:0645,971390,318,831380,559,0001,003,0002,113,536
2May 12, 2026 02:0646,153391,749,914382,071,0001,004,0002,113,536
3May 12, 2026 02:0646,302395,383,604383,304,0001,003,0002,113,536
4May 12, 2026 02:0646,308396,047,650383,342,0001,018,0002,113,536
5May 12, 2026 02:0646,310395,380,185383,375,0001,005,0002,113,536
6May 12, 2026 02:0646,313393,009,555383,394,0001,004,0002,113,536
7May 12, 2026 02:0646,320393,716,183383,460,0001,003,0002,113,536
8May 12, 2026 02:0646,331393,539,574383,546,0001,003,0002,113,536
9May 12, 2026 02:0646,355395,810,818383,747,0001,003,0002,113,536