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:33Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 01:39Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:39042,928,88433,960,0001,066,00020,480expected "74600294196621100 ", got "17101192389373740 "
2Jul 7, 2026 01:39043,040,21033,801,0001,018,00020,480expected "74600294196621100 ", got "17101192389373740 "
3Jul 7, 2026 01:39042,918,73633,989,0001,034,00020,480expected "74600294196621100 ", got "17101192389373740 "
4Apr 13, 2026 18:334,43862,734,02934,846,0001,991,0002,535,424
5Apr 13, 2026 18:334,44069,390,69834,861,0001,992,0002,273,280
6Apr 13, 2026 18:334,45766,971,55034,997,0001,999,0002,482,176