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 listMay 11, 2026 07:52wnwnScore: 3,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:523,35636,816,55426,834,0001,025,0002,113,536
2May 11, 2026 07:523,35635,066,18226,821,0001,035,0002,113,536
3May 11, 2026 07:523,36335,153,08026,913,0001,004,0002,113,536
4May 11, 2026 07:523,37537,376,89526,977,0001,042,0002,113,536
5May 11, 2026 07:523,46337,395,92227,740,0001,004,0002,113,536
6May 11, 2026 07:523,50838,593,49828,091,0001,026,0002,113,536
7May 11, 2026 07:523,50937,946,33828,089,0001,037,0002,113,536
8May 11, 2026 07:523,51536,836,04828,154,0001,024,0002,113,536
9May 11, 2026 07:523,56237,635,78628,531,0001,035,0002,113,536