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 listApr 5, 2026 20:33wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 22:58Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:58041,481,57732,172,0001,180,0002,113,536expected "74600294196621100 ", got "40631258385239852 "
2Jul 6, 2026 22:58043,879,13434,529,0001,162,0002,113,536expected "74600294196621100 ", got "44097370043673644 "
3Jul 6, 2026 22:58043,807,15734,295,0001,149,0002,113,536expected "74600294196621100 ", got "44108921225654828 "
4Apr 5, 2026 20:334,24361,322,44734,208,0001,006,0002,494,464
5Apr 5, 2026 20:334,27359,698,57734,449,0001,013,0002,498,560
6Apr 5, 2026 20:334,29763,286,78334,647,0001,019,0002,277,376