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 listMay 3, 2026 05:36limanjun99limanjun99Score: 5,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 05:365,31162,596,45540,076,0004,007,0002,428,928
2May 3, 2026 05:365,32161,580,43540,155,0004,015,0002,428,928
3May 3, 2026 05:365,35163,654,89240,383,0004,038,0002,420,736
4May 3, 2026 05:365,36062,093,08740,449,0004,044,0002,383,872
5May 3, 2026 05:365,37968,932,27740,592,0004,059,0002,433,024
6May 3, 2026 05:365,38661,998,64340,640,0004,064,0002,428,928
7May 3, 2026 05:365,42265,857,85240,007,0005,000,0002,424,832
8May 3, 2026 05:365,44062,151,50941,139,0004,013,0002,433,024
9May 3, 2026 05:365,44162,837,18141,153,0004,014,0002,428,928