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 01:46Ondřej PolaneckýOndřej PolaneckýScore: 10,381Success
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 01:4610,359108,514,35384,984,000999,0002,277,376
2Mar 19, 2026 01:4610,381112,961,18884,162,0002,003,0002,273,280
3Mar 19, 2026 01:4610,699114,709,35686,809,0001,995,0002,379,776