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 listSep 17, 2025 20:48Adam FolwarcznyAdam FolwarcznyScore: 58,697Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2025 20:4858,641508,573,950424,756,00061,964,0002,273,280
2Sep 17, 2025 20:4858,697509,252,835430,160,00057,021,0002,404,352
3Sep 17, 2025 20:4858,748513,634,810430,658,00056,954,0002,396,160