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 23, 2026 16:21wnwnScore: 5,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 16:215,35764,871,67543,456,0001,010,0002,490,368
2Feb 23, 2026 16:215,37771,875,75243,616,0001,014,0002,494,464
3Feb 23, 2026 16:215,41871,545,17642,975,0001,998,0002,273,280