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 listSep 13, 2025 16:28Tony SolomonikTony SolomonikScore: 378,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2025 16:28376,6973,155,417,9893,049,622,00076,965,0002,281,472
2Sep 13, 2025 16:28377,1503,153,427,9273,063,381,00066,964,0002,285,568
3Sep 13, 2025 16:28378,0313,160,490,9473,068,690,00068,970,0002,285,568
4Sep 13, 2025 16:28378,0373,165,709,9333,074,755,00062,954,0002,285,568
5Sep 13, 2025 16:28378,1663,166,645,3153,085,796,00052,979,0002,285,568
6Sep 13, 2025 16:28379,8903,182,937,1183,093,126,00059,963,0002,281,472
7Sep 13, 2025 16:28380,5433,184,157,5863,092,536,00065,968,0002,359,296
8Sep 13, 2025 16:28382,4993,203,590,4583,116,764,00057,977,0002,289,664
9Sep 13, 2025 16:28391,1673,271,753,3183,178,739,00067,951,0002,359,296