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 11:35wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:06Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:07038,028,70528,975,0001,123,0002,113,536expected "74600294196621100 ", got "72478732244585516 "
2Jul 6, 2026 21:07038,164,44529,171,0001,168,0002,113,536expected "74600294196621100 ", got "72213675716736556 "
3Jul 6, 2026 21:07038,047,78528,852,0001,121,0002,113,536expected "74600294196621100 ", got "72471340834688812 "
4Apr 13, 2026 11:354,10562,580,90432,069,0002,004,0002,490,368
5Apr 13, 2026 11:354,19861,944,63133,845,000995,0002,490,368
6Apr 13, 2026 11:354,24355,431,43333,206,0002,012,0002,482,176