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 listJun 30, 2026 10:50Adam FolwarcznyAdam FolwarcznyScore: 7,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 10:517,39170,723,60660,115,0001,234,0002,113,536
2Jun 30, 2026 10:517,39870,673,77260,278,0001,130,0002,113,536
3Jun 30, 2026 10:517,43471,045,21260,460,0001,250,0002,113,536
4Jun 30, 2026 10:517,44171,090,38660,517,0001,245,0002,113,536
5Jun 30, 2026 10:517,44672,463,48560,544,0001,263,0002,113,536
6Jun 30, 2026 10:517,45171,099,96760,704,0001,145,0002,113,536
7Jun 30, 2026 10:517,48071,376,82360,842,0001,249,0002,113,536
8Jun 30, 2026 10:517,54772,077,88861,395,0001,248,0002,113,536
9Jun 30, 2026 10:517,60472,376,27561,880,0001,235,0002,113,536