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 22, 2026 08:39wnwnScore: 4,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 08:414,33450,073,23133,976,0001,998,0002,490,368
2Apr 22, 2026 08:414,40549,496,98235,547,0001,015,0002,482,176
3Apr 22, 2026 08:414,41354,410,85035,615,0001,017,0002,490,368
4Apr 22, 2026 08:414,41352,722,16335,611,0001,017,0002,486,272
5Apr 22, 2026 08:414,46449,166,08735,055,0002,003,0002,490,368
6Apr 22, 2026 08:414,51554,671,43136,466,0001,012,0002,482,176
7Apr 22, 2026 08:414,55354,786,73135,809,0001,989,0002,482,176
8Apr 22, 2026 08:414,55451,877,84335,811,0001,989,0002,326,528
9Apr 22, 2026 08:414,59954,288,12037,174,0001,004,0002,486,272