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 03:39wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:49Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:49037,966,58230,119,00002,113,536expected "45499006849167363 ", got "45379696675621423 "
2Jul 7, 2026 03:49038,174,42830,220,00002,113,536expected "45497118216105612 ", got "45377582012651735 "
3Jul 7, 2026 03:49037,997,55730,133,00002,113,536expected "45500294378059307 ", got "45381259925929147 "
4Jul 7, 2026 03:393,29135,167,31826,279,0001,037,0002,113,536
5Jul 7, 2026 03:393,30437,028,32626,426,0001,002,0002,113,536
6Jul 7, 2026 03:393,31335,312,87226,475,0001,028,0002,113,536
7Jul 7, 2026 03:393,32335,401,68426,574,0001,010,0002,113,536
8Jul 7, 2026 03:393,35535,646,87926,806,0001,047,0002,113,536
9Jul 7, 2026 03:393,44037,092,53327,518,0001,034,0002,113,536
10Jul 7, 2026 03:393,47637,396,37727,832,0001,026,0002,113,536
11Jul 7, 2026 03:393,48137,361,92527,863,0001,034,0002,113,536
12Jul 7, 2026 03:393,50637,434,23128,062,0001,045,0002,113,536