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 29, 2025 19:12Rajarshi BasuRajarshi BasuScore: 30,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2025 19:1230,330281,475,716249,745,0001,997,0002,269,184
2Nov 29, 2025 19:1230,349276,828,851249,900,0001,999,0002,289,664
3Nov 29, 2025 19:1230,471282,727,658251,907,000999,0002,514,944