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 listOct 11, 2025 05:12Marco BarboneMarco BarboneScore: 31,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 05:1231,514288,396,800260,565,0001,002,0002,379,776
2Oct 11, 2025 05:1231,529286,174,985259,693,0001,997,0002,269,184
3Oct 11, 2025 05:1233,266299,387,929275,108,0001,000,0002,289,664