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 30, 2026 15:56Saif Al-HarthiSaif Al-HarthiScore: 10,877Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 15:5710,55697,098,92186,513,0001,109,0002,117,632
2Jun 30, 2026 15:5710,57497,042,00186,658,0001,108,0002,117,632
3Jun 30, 2026 15:5710,59297,419,14586,791,0001,126,0002,117,632
4Jun 30, 2026 15:5710,59697,334,04786,822,0001,130,0002,117,632
5Jun 30, 2026 15:5710,87799,727,95389,178,0001,108,0002,117,632
6Jun 30, 2026 15:5710,87999,750,74689,175,0001,122,0002,117,632
7Jun 30, 2026 15:5710,88399,808,44489,204,0001,125,0002,117,632
8Jun 30, 2026 15:5710,89299,810,70389,274,0001,135,0002,117,632
9Jun 30, 2026 15:5710,89999,914,50089,321,0001,147,0002,117,632