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 listNov 8, 2025 20:58izotoffizotoffScore: 203,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2025 20:58202,9531,711,150,8371,586,541,00097,971,0002,326,528
2Nov 8, 2025 20:58202,9851,713,132,4331,588,785,00095,987,0002,437,120
3Nov 8, 2025 20:58203,0191,712,137,9771,597,106,00087,950,0002,326,528
4Nov 8, 2025 20:58203,1191,714,683,7071,606,942,00078,948,0002,326,528
5Nov 8, 2025 20:58203,1861,712,622,5121,606,471,00079,973,0002,326,528
6Nov 8, 2025 20:58203,2531,712,749,3401,598,051,00088,947,0002,285,568
7Nov 8, 2025 20:58203,2861,713,490,8351,598,311,00088,961,0002,441,216
8Nov 8, 2025 20:58203,3941,713,489,8301,583,226,000104,948,0002,326,528
9Nov 8, 2025 20:58203,7701,718,233,9021,603,326,00087,963,0002,326,528