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 23:33Marco BarboneMarco BarboneScore: 31,531Success
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 23:3331,444279,523,251259,984,000999,0002,424,832
2Oct 11, 2025 23:3331,531289,496,258259,707,0001,997,0002,277,376
3Oct 11, 2025 23:3331,567290,086,584261,004,0001,000,0002,539,520