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 04:30limanjun99limanjun99Score: 14,870Success
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 04:3014,155132,093,936112,510,0004,978,0002,412,544
2May 3, 2026 04:3014,180136,621,680110,715,0006,982,0002,420,736
3May 3, 2026 04:3014,183134,279,708110,739,0006,983,0002,412,544
4May 3, 2026 04:3014,188140,269,891111,774,0005,987,0002,420,736
5May 3, 2026 04:3014,870145,294,150118,407,0005,017,0002,433,024
6May 3, 2026 04:3014,875140,432,510118,449,0005,019,0002,408,448
7May 3, 2026 04:3014,882138,306,078117,548,0005,977,0002,420,736
8May 3, 2026 04:3014,900145,200,309118,691,0004,987,0002,404,352
9May 3, 2026 04:3014,911141,587,106117,777,0005,988,0002,424,832