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 20, 2026 15:36wnwnScore: 5,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 15:365,43966,844,86543,135,0002,006,0002,494,464
2Feb 20, 2026 15:365,45265,058,73344,247,0001,005,0002,277,376
3Feb 20, 2026 15:365,47269,119,94244,406,0001,009,0002,277,376