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 11, 2026 00:50Victor MerckléVictor MerckléScore: 6,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 00:506,03557,766,39149,076,0001,020,0002,113,536
2Jun 11, 2026 00:506,10258,223,55949,615,0001,038,0002,113,536
3Jun 11, 2026 00:506,14958,614,89350,019,0001,020,0002,113,536
4Jun 11, 2026 00:506,15358,660,88850,047,0001,025,0002,113,536
5Jun 11, 2026 00:506,17458,856,42449,202,0002,048,0002,113,536
6Jun 11, 2026 00:506,19859,067,03549,436,0002,014,0002,113,536
7Jun 11, 2026 00:506,22359,566,62749,626,0002,030,0002,113,536
8Jun 11, 2026 00:506,22459,233,52949,637,0002,030,0002,113,536
9Jun 11, 2026 00:506,25659,868,80049,905,0002,028,0002,113,536