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 12, 2025 12:18Aliaksandr MikheiAliaksandr MikheiScore: 75,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 12:1875,102647,252,462562,313,00061,034,0002,285,568
2Nov 12, 2025 12:1875,117649,430,045557,528,00065,944,0002,510,848
3Nov 12, 2025 12:1875,126654,626,533551,601,00071,948,0002,285,568
4Nov 12, 2025 12:1875,138648,457,836555,684,00067,961,0002,285,568
5Nov 12, 2025 12:1875,145650,096,732561,731,00061,970,0002,510,848
6Nov 12, 2025 12:1875,154646,542,641563,798,00059,978,0002,519,040
7Nov 12, 2025 12:1875,190649,294,505556,066,00068,008,0002,277,376
8Nov 12, 2025 12:1875,209653,928,600554,210,00070,026,0002,285,568
9Nov 12, 2025 12:1875,266648,812,113564,733,00059,971,0002,519,040