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 19, 2026 19:23wnwnScore: 5,284Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 19:235,28268,146,40242,846,000996,0002,445,312
2Feb 19, 2026 19:235,28467,237,48140,871,0002,990,0002,285,568
3Feb 19, 2026 19:235,29868,750,90040,979,0002,998,0002,535,424