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 30, 2025 06:28Anton SkvortsovAnton SkvortsovScore: 398,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2025 06:28397,2253,328,467,5163,223,010,00073,954,0002,285,568
2Oct 30, 2025 06:28397,2913,324,140,9503,227,548,00069,968,0002,355,200
3Oct 30, 2025 06:28397,3733,320,854,4233,235,234,00062,965,0002,281,472
4Oct 30, 2025 06:28397,9533,327,376,5643,244,046,00058,964,0002,285,568
5Oct 30, 2025 06:28398,0023,329,863,2303,232,453,00070,966,0002,281,472
6Oct 30, 2025 06:28398,2823,332,307,2523,244,766,00060,976,0002,359,296
7Oct 30, 2025 06:28398,3503,331,280,5383,235,341,00070,963,0002,281,472
8Oct 30, 2025 06:28401,7733,362,910,1183,267,760,00066,954,0002,281,472
9Oct 30, 2025 06:28424,5893,553,021,0783,452,131,00071,961,0002,355,200