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:49Ondřej PolaneckýOndřej PolaneckýScore: 14,847Success
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:4914,622142,411,086120,360,0001,003,0002,404,352
2Mar 20, 2026 22:4914,847145,183,209122,232,0001,001,0002,396,160
3Mar 20, 2026 22:4914,920148,696,888122,842,000998,0002,392,064