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 listJun 22, 2025 08:42infiKNIGHTeinfiKNIGHTeScore: 336,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 08:42336,2492,815,717,8542,718,896,00071,970,0002,273,280
2Jun 22, 2025 08:42336,5262,822,564,4842,740,179,00052,984,0002,273,280
3Jun 22, 2025 08:42336,6022,822,634,3312,729,821,00063,972,0002,375,680