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 listDec 8, 2025 12:09thatmagicalcatthatmagicalcatScore: 72,148Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 12:0972,114630,423,237598,546,00002,314,240
2Dec 8, 2025 12:0972,148630,225,853597,832,000999,0002,428,928
3Dec 8, 2025 12:0974,483649,829,943598,235,00019,974,0002,318,336