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 04:09Marco BarboneMarco BarboneScore: 31,199Success
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 04:0931,171286,476,299257,718,000998,0002,289,664
2Oct 11, 2025 04:0931,199282,132,834256,950,0001,999,0002,285,568
3Oct 11, 2025 04:0931,208286,198,485257,029,0002,000,0002,289,664