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 14, 2026 08:40wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 18:41Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 18:41041,135,54032,151,0001,076,0002,113,536expected "74600294196621100 ", got "74101232304304428 "
2Jul 6, 2026 18:41037,344,44728,239,0001,114,0002,113,536expected "74600294196621100 ", got "72497847262161708 "
3Jul 6, 2026 18:41038,310,64929,217,0001,109,0002,113,536expected "74600294196621100 ", got "72397262718619180 "
4Apr 14, 2026 08:404,04963,687,96832,591,0001,018,0002,494,464
5Apr 14, 2026 08:404,05158,143,64832,603,0001,018,0002,502,656
6Apr 14, 2026 08:404,23656,272,53333,151,0002,009,0002,486,272