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 listJul 7, 2026 10:24Kevin HeaveyKevin HeaveyScore: 8,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 10:248,11776,863,92866,261,0001,115,0002,117,632
2Jul 7, 2026 10:248,13477,067,18466,286,0001,234,0002,117,632
3Jul 7, 2026 10:248,15377,138,84566,533,0001,142,0002,117,632
4Jul 7, 2026 10:248,18280,439,65466,761,0001,150,0002,117,632
5Jul 7, 2026 10:248,19077,511,53566,851,0001,134,0002,117,632
6Jul 7, 2026 10:248,26678,194,59667,388,0001,223,0002,117,632
7Jul 7, 2026 10:248,27280,044,14267,461,0001,197,0002,117,632
8Jul 7, 2026 10:248,34778,802,81868,157,0001,130,0002,117,632
9Jul 7, 2026 10:248,45886,874,91068,948,0001,259,0002,117,632