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 19, 2026 00:25Ondřej PolaneckýOndřej PolaneckýScore: 19,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 00:2519,148182,096,442157,930,000999,0002,289,664
2Mar 19, 2026 00:2519,166186,337,903157,080,0002,001,0002,289,664
3Mar 19, 2026 00:2519,226189,967,278158,576,0001,003,0002,285,568