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 24, 2026 16:03timothygktimothygkScore: 9,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 16:089,11386,605,05265,068,00010,575,0002,117,632stderr
2Oct 24, 2026 16:089,12187,146,19464,682,00011,026,0002,117,632stderr
3Oct 24, 2026 16:089,14687,308,00764,948,00010,968,0002,117,632stderr
4Oct 24, 2026 16:089,15787,044,26964,849,00011,156,0002,117,632stderr
5Oct 24, 2026 16:089,15987,094,80264,979,00011,042,0002,117,632stderr
6Oct 24, 2026 16:089,17487,656,38565,137,00011,015,0002,117,632stderr
7Oct 24, 2026 16:089,20987,888,82664,723,00011,713,0002,117,632stderr
8Oct 24, 2026 16:089,76792,498,07269,972,00011,096,0002,117,632stderr
9Oct 24, 2026 16:089,83193,044,78170,459,00011,141,0002,117,632stderr