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 15, 2026 10:29Milo PresedoMilo PresedoScore: 7,902Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 14:44M-Rochat10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 10:307,87374,468,73164,217,0001,133,0002,113,536
2May 15, 2026 10:307,89074,263,45064,474,0001,018,0002,113,536
3May 15, 2026 10:307,89874,337,63764,543,0001,018,0002,113,536
4May 15, 2026 10:307,89874,685,74864,542,0001,016,0002,113,536
5May 15, 2026 10:307,90277,198,69364,574,0001,017,0002,113,536
6May 15, 2026 10:307,90575,939,53564,594,0001,018,0002,113,536
7May 15, 2026 10:307,90877,271,17364,626,0001,018,0002,113,536
8May 15, 2026 10:307,92076,683,56964,724,0001,020,0002,113,536
9May 15, 2026 10:308,26879,084,89867,610,0001,015,0002,113,536