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:18thatmagicalcatthatmagicalcatScore: 378,728Success
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:18378,3663,165,001,9373,071,472,00068,965,0002,285,568
2Jun 3, 2025 19:18378,4463,166,287,1613,074,145,00066,959,0002,281,472
3Jun 3, 2025 19:18378,4573,165,470,4423,071,238,00069,959,0002,281,472
4Jun 3, 2025 19:18378,5103,163,902,7503,075,661,00065,971,0002,359,296
5Jun 3, 2025 19:18378,7283,168,805,8533,066,483,00076,961,0002,285,568
6Jun 3, 2025 19:18378,8953,173,237,2923,068,880,00075,947,0002,285,568
7Jun 3, 2025 19:18379,1603,175,595,7433,076,052,00070,978,0002,289,664
8Jun 3, 2025 19:18380,6363,191,161,1193,097,309,00061,966,0002,281,472
9Jun 3, 2025 19:18388,4663,253,966,7663,150,306,00073,960,0002,285,568