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 listFeb 24, 2026 19:59wnwnScore: 4,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 19:594,67861,470,46436,837,0001,991,0002,273,280
2Feb 24, 2026 19:594,68364,582,56836,873,0001,993,0002,531,328
3Feb 24, 2026 19:594,69060,681,03236,932,0001,996,0002,490,368