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 21, 2026 21:02wnwnScore: 5,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 21:025,19866,279,58541,135,0002,006,0002,277,376
2Feb 21, 2026 21:025,23065,429,02742,401,0001,009,0002,486,272
3Feb 21, 2026 21:025,23469,333,65342,430,0001,010,0002,277,376