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 21:55Marco BarboneMarco BarboneScore: 30,393Success
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 21:5529,220267,266,929242,525,00002,437,120
2Oct 11, 2025 21:5530,393272,965,862252,264,00002,277,376
3Oct 11, 2025 21:5530,476272,585,052250,955,0001,999,0002,433,024