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 3, 2025 19:37thatmagicalcatthatmagicalcatScore: 316,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2025 19:37316,4182,658,627,2092,549,292,00076,978,0002,289,664
2Jun 3, 2025 19:37316,4242,650,345,3362,564,362,00061,960,0002,285,568
3Jun 3, 2025 19:37316,5072,655,169,9182,572,033,00054,979,0002,281,472
4Jun 3, 2025 19:37316,5672,658,386,3992,572,535,00054,968,0002,285,568
5Jun 3, 2025 19:37316,7002,651,137,8172,566,641,00061,967,0002,289,664
6Jun 3, 2025 19:37316,9652,658,865,2582,569,836,00060,972,0002,355,200
7Jun 3, 2025 19:37317,3472,662,989,2582,573,004,00060,976,0002,285,568
8Jun 3, 2025 19:37317,5202,667,196,0982,567,459,00067,959,0002,281,472
9Jun 3, 2025 19:37318,7592,675,491,9832,573,738,00071,964,0002,363,392