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 listMar 20, 2026 22:51Ondřej PolaneckýOndřej PolaneckýScore: 16,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 22:5116,386155,155,177134,003,0002,000,0002,269,184
2Mar 20, 2026 22:5116,396168,736,859134,083,0002,001,0002,281,472
3Mar 20, 2026 22:5116,582164,878,447136,630,0001,004,0002,265,088