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 21, 2026 12:11Victor MerckléVictor MerckléScore: 4,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 12:124,88349,432,86539,460,0001,075,0002,113,536
2May 21, 2026 12:124,89751,621,21639,580,0001,071,0002,113,536
3May 21, 2026 12:124,90048,574,35139,608,0001,067,0002,113,536
4May 21, 2026 12:124,90351,936,65039,691,0001,011,0002,113,536
5May 21, 2026 12:124,91348,688,61139,741,0001,042,0002,113,536
6May 21, 2026 12:124,92548,759,63239,823,0001,059,0002,113,536
7May 21, 2026 12:124,96249,012,25840,183,0001,008,0002,113,536
8May 21, 2026 12:125,06053,256,29240,966,0001,032,0002,113,536
9May 21, 2026 12:125,06350,086,60241,026,0001,004,0002,113,536