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 listNov 30, 2025 15:53Rajarshi BasuRajarshi BasuScore: 19,004Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 30, 2025 15:5318,550180,337,349152,967,000999,0002,289,664
2Nov 30, 2025 15:5319,004186,177,206155,736,0001,996,0002,527,232
3Nov 30, 2025 15:5319,020183,366,937155,867,0001,998,0002,269,184