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 listJul 7, 2026 05:28wnwnScore: 3,294Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 16, 2026 15:47Kevin Heavey10.00CustomSolution Held
Jul 15, 2026 17:26Kevin Heavey10.00CustomSolution Held
Jul 15, 2026 17:26Kevin Heavey10.00CustomSolution Held
Jul 7, 2026 21:27Adam Folwarczny10.00CustomSolution Held
Jul 7, 2026 05:57Victor Mercklé10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:293,29235,250,56226,294,0001,035,0002,113,536
2Jul 7, 2026 05:293,29235,139,78326,326,0001,003,0002,113,536
3Jul 7, 2026 05:293,29235,162,86626,313,0001,016,0002,113,536
4Jul 7, 2026 05:293,29335,359,05526,309,0001,027,0002,113,536
5Jul 7, 2026 05:293,29435,177,75526,342,0001,005,0002,113,536
6Jul 7, 2026 05:293,30435,254,43926,410,0001,015,0002,113,536
7Jul 7, 2026 05:293,40236,100,45727,237,0001,007,0002,113,536
8Jul 7, 2026 05:293,46636,635,52127,765,0001,011,0002,113,536
9Jul 7, 2026 05:293,47337,323,88427,795,0001,032,0002,113,536