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 15, 2026 22:33wnwnScore: 9,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 22:338,46994,715,60563,264,0007,029,0002,494,464
2Feb 15, 2026 22:338,47299,897,42763,289,0007,032,0002,441,216
3Feb 15, 2026 22:338,62097,271,68164,492,0007,053,0002,465,792
4Feb 15, 2026 22:339,690102,056,23572,388,0008,043,0002,461,696
5Feb 15, 2026 22:339,811103,699,23571,379,00010,053,0002,494,464
6Feb 15, 2026 22:339,853108,778,68272,803,0008,975,0002,498,560