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 listNov 2, 2025 16:01triscacezar-droidtriscacezar-droidScore: 2,067,643Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2025 16:012,058,02017,112,461,67217,014,599,00066,966,0002,277,376
2Nov 2, 2025 16:012,064,80117,176,654,34617,069,887,00067,963,0002,277,376
3Nov 2, 2025 16:012,066,14917,181,452,28917,092,061,00056,973,0002,285,568
4Nov 2, 2025 16:012,067,15917,193,001,78117,105,442,00051,977,0002,277,376
5Nov 2, 2025 16:012,067,64317,197,678,63717,091,466,00069,969,0002,289,664
6Nov 2, 2025 16:012,068,14017,203,118,56417,102,598,00062,965,0002,277,376
7Nov 2, 2025 16:012,078,04017,277,375,08317,189,768,00057,968,0002,277,376
8Nov 2, 2025 16:012,079,62517,300,346,29717,197,914,00062,970,0002,289,664
9Nov 2, 2025 16:012,104,22317,500,578,02417,396,080,00068,968,0002,277,376