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 listDec 4, 2025 13:24Rajarshi BasuRajarshi BasuScore: 9,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 13:248,92798,483,71272,096,0002,002,0002,289,664
2Dec 4, 2025 13:248,92997,012,96072,110,0002,003,0002,289,664
3Dec 4, 2025 13:248,939100,351,74272,192,0002,005,0002,289,664
4Dec 4, 2025 13:249,100103,733,28274,522,0001,007,0002,465,792
5Dec 4, 2025 13:249,217102,920,35276,499,00002,461,696
6Dec 4, 2025 13:249,344105,116,26276,550,0001,007,0002,289,664