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 13, 2026 18:56Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 00:01Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 00:01042,050,81432,969,0001,132,0002,117,632expected "74600294196621100 ", got "15382837741203244 "
2Jul 7, 2026 00:01042,017,78033,026,0001,148,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
3Jul 7, 2026 00:01043,439,42732,889,0001,114,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
4Apr 13, 2026 18:564,31663,776,07433,830,0001,990,0002,461,696
5Apr 13, 2026 18:564,31859,746,71434,848,000995,0002,469,888
6Apr 13, 2026 18:564,31861,706,04533,849,0001,991,0002,473,984