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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:15Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:15038,028,63328,875,0001,157,0002,113,536expected "74600294196621100 ", got "72474745678597164 "
2Jul 6, 2026 20:15040,430,50131,344,0001,083,0002,113,536expected "74600294196621100 ", got "74093494260361516 "
3Jul 6, 2026 20:15037,238,13428,305,0001,139,0002,113,536expected "74600294196621100 ", got "72386560209658668 "
4Apr 13, 2026 11:374,07356,763,84331,820,0001,988,0002,277,376
5Apr 13, 2026 11:374,11254,304,31232,123,0002,007,0002,498,560
6Apr 13, 2026 11:374,29459,827,71734,620,0001,018,0002,494,464