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 listJun 28, 2026 07:28Shikhar SoniShikhar SoniScore: 8,890Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 07:288,78982,331,00766,202,0006,751,0002,121,728
2Jun 28, 2026 07:288,80282,611,44565,969,0007,090,0002,121,728
3Jun 28, 2026 07:288,85882,982,60466,709,0006,814,0002,121,728
4Jun 28, 2026 07:288,87683,057,59666,549,0007,128,0002,121,728
5Jun 28, 2026 07:288,89083,159,23266,490,0007,305,0002,117,632
6Jun 28, 2026 07:288,91883,544,99066,999,0007,028,0002,117,632
7Jun 28, 2026 07:288,92483,497,61667,139,0006,934,0002,121,728
8Jun 28, 2026 07:288,98984,569,20667,139,0007,470,0002,121,728
9Jun 28, 2026 07:289,11485,175,32768,399,0007,248,0002,121,728