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 listMar 15, 2026 14:33wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:00Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:00042,474,20032,445,0001,018,0002,113,536expected "74600294196621100 ", got "72032325620594220 "
2Jul 6, 2026 23:00045,687,06134,449,0001,168,0002,113,536expected "74600294196621100 ", got "73483152965465900 "
3Jul 6, 2026 23:00042,117,78132,338,0001,163,0002,113,536expected "74600294196621100 ", got "73533563358369324 "
4Mar 15, 2026 14:324,23855,836,69133,166,0002,010,0002,490,368
5Mar 15, 2026 14:334,26261,464,19134,364,0001,010,0002,273,280
6Mar 15, 2026 14:324,27059,267,51234,428,0001,012,0002,273,280
7Mar 15, 2026 14:324,27553,843,92734,471,0001,013,0002,490,368
8Mar 15, 2026 14:334,27656,391,11334,475,0001,013,0002,273,280
9Mar 15, 2026 14:334,28959,290,03634,585,0001,017,0002,273,280