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 27, 2025 02:00Marco BarboneMarco BarboneScore: 256,056Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2025 02:00255,4692,142,714,1522,064,410,00055,984,0002,277,376
2Jul 27, 2025 02:00255,5992,147,177,0092,066,486,00054,986,0002,277,376
3Jul 27, 2025 02:00256,0162,151,289,1032,055,967,00068,965,0002,273,280
4Jul 27, 2025 02:00256,0472,152,428,6622,061,216,00063,975,0002,519,040
5Jul 27, 2025 02:00256,0562,150,962,0422,075,282,00049,982,0002,273,280
6Jul 27, 2025 02:00256,0762,153,543,6162,054,483,00070,947,0002,277,376
7Jul 27, 2025 02:00256,5242,155,655,3662,058,175,00070,971,0002,265,088
8Jul 27, 2025 02:00257,1132,160,614,4672,075,061,00058,973,0002,273,280
9Jul 27, 2025 02:00257,3582,157,276,1622,072,101,00063,972,0002,277,376