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 21:19izotoffizotoffScore: 203,318Success
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 21:19202,9551,707,227,7151,572,562,000111,968,0002,326,528
2Nov 8, 2025 21:19203,1321,712,170,5271,586,056,00099,940,0002,326,528
3Nov 8, 2025 21:19203,1431,715,767,1331,602,134,00083,954,0002,433,024
4Nov 8, 2025 21:19203,1701,709,966,6401,598,347,00087,964,0002,326,528
5Nov 8, 2025 21:19203,3181,714,416,3021,585,569,000101,972,0002,326,528
6Nov 8, 2025 21:19203,3431,722,564,7951,595,763,00091,986,0002,326,528
7Nov 8, 2025 21:19203,3711,709,428,0571,593,037,00094,942,0002,326,528
8Nov 8, 2025 21:19203,4471,717,257,8991,616,624,00071,983,0002,326,528
9Nov 8, 2025 21:19203,7671,715,610,8121,604,303,00086,962,0002,437,120