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 listOct 15, 2026 08:19timothygktimothygkScore: 110,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 08:19109,617920,308,797682,989,000226,835,0002,113,536
2Oct 15, 2026 08:19109,651920,612,208685,911,000224,200,0002,113,536
3Oct 15, 2026 08:19109,789921,868,706687,470,000223,783,0002,113,536
4Oct 15, 2026 08:19110,068924,015,216686,977,000226,590,0002,113,536
5Oct 15, 2026 08:19110,081924,213,687683,707,000229,969,0002,113,536
6Oct 15, 2026 08:19110,113924,910,342687,566,000226,374,0002,113,536
7Oct 15, 2026 08:19110,124924,448,199684,801,000229,231,0002,113,536
8Oct 15, 2026 08:19110,190925,093,377686,876,000227,701,0002,113,536
9Oct 15, 2026 08:19110,232925,911,902686,551,000228,382,0002,113,536