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:23Rajarshi BasuRajarshi BasuScore: 9,039Success
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:238,83097,999,04471,280,0002,007,0002,289,664
2Dec 4, 2025 13:238,851100,176,48372,455,0001,006,0002,289,664
3Dec 4, 2025 13:238,85398,303,95072,473,0001,006,0002,465,792
4Dec 4, 2025 13:239,039100,765,49173,021,0002,000,0002,289,664
5Dec 4, 2025 13:239,04499,493,61473,061,0002,001,0002,461,696
6Dec 4, 2025 13:239,10099,860,41974,524,0001,007,0002,289,664