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 5, 2025 08:35parsersmailparsersmailScore: 121,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2025 08:35121,6681,038,747,8251,006,843,0002,999,0002,457,600
2May 5, 2025 08:35121,7071,035,390,7861,009,167,0001,000,0002,465,792
3May 5, 2025 08:35121,7651,046,135,8041,006,649,0003,998,0002,322,432