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:57Adam FolwarcznyAdam FolwarcznyScore: 66,727Success
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:5766,622581,826,900550,966,0001,999,0002,400,256
2Sep 17, 2025 20:5766,727589,402,538550,835,0002,999,0002,269,184
3Sep 17, 2025 20:5766,857585,220,496552,915,0001,999,0002,269,184