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 listSep 13, 2026 15:51Kita RenjiKita RenjiScore: 8,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2026 15:518,45480,352,42468,951,0001,224,0002,113,536
2Sep 13, 2026 15:518,45880,435,07568,968,0001,236,0002,113,536
3Sep 13, 2026 15:518,45880,402,45968,963,0001,245,0002,113,536
4Sep 13, 2026 15:518,46080,425,55369,054,0001,164,0002,113,536
5Sep 13, 2026 15:518,47080,404,34169,159,0001,145,0002,113,536
6Sep 13, 2026 15:518,49280,711,38369,321,0001,164,0002,113,536
7Sep 13, 2026 15:518,52480,952,11169,533,0001,223,0002,113,536
8Sep 13, 2026 15:518,53082,107,04269,798,0001,009,0002,113,536
9Sep 13, 2026 15:518,55181,073,12169,815,0001,163,0002,113,536