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 5, 2026 02:15FrederickFrederickScore: 8,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 02:168,37480,060,46667,459,0002,047,0002,117,632
2Oct 5, 2026 02:168,49881,193,80868,507,0002,028,0002,117,632
3Oct 5, 2026 02:168,52581,971,59868,752,0002,006,0002,117,632
4Oct 5, 2026 02:168,53781,430,17968,834,0002,031,0002,117,632
5Oct 5, 2026 02:168,60182,421,50470,376,0001,016,0002,117,632
6Oct 5, 2026 02:168,62882,842,70469,612,0002,008,0002,117,632
7Oct 5, 2026 02:168,66482,523,35470,898,0001,015,0002,117,632
8Oct 5, 2026 02:168,71882,849,05470,341,0002,023,0002,117,632
9Oct 5, 2026 02:168,76083,998,33570,684,0002,029,0002,117,632