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 listNov 30, 2025 12:22Rajarshi BasuRajarshi BasuScore: 16,146Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 30, 2025 12:2216,135161,442,332131,921,0001,998,0002,523,136
2Nov 30, 2025 12:2216,145159,990,684133,007,0001,000,0002,289,664
3Nov 30, 2025 12:2216,146164,114,693132,012,0002,000,0002,523,136
4Nov 30, 2025 12:2216,146159,638,349132,014,0002,000,0002,269,184
5Nov 30, 2025 12:2216,152159,025,437132,061,0002,000,0002,289,664
6Nov 30, 2025 12:2216,391165,082,885135,047,0001,000,0002,269,184