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 19, 2026 03:48wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:03Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:03040,539,89431,493,0001,007,0002,113,536expected "74600294196621100 ", got "74534440785599170 "
2Jul 6, 2026 20:03040,499,29731,502,0001,006,0002,113,536expected "74600294196621100 ", got "74534440758797170 "
3Jul 6, 2026 20:03040,808,44631,626,0001,097,0002,113,536expected "74600294196621100 ", got "74534441010599170 "
4Apr 19, 2026 03:484,09156,002,03831,957,0001,997,0002,531,328
5Apr 19, 2026 03:484,09253,073,19831,966,0001,997,0002,269,184
6Apr 19, 2026 03:484,15058,218,50233,436,0001,013,0002,277,376