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 12, 2025 21:10Marco BarboneMarco BarboneScore: 32,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2025 21:1032,201290,213,370266,266,0001,001,0002,277,376
2Oct 12, 2025 21:1032,209295,672,851267,334,00002,277,376
3Oct 12, 2025 21:1032,210290,554,721267,340,00002,539,520