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 17, 2025 12:30RyogaRyogaScore: 173,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2025 12:30172,4731,456,208,6391,219,595,000211,929,0002,416,640
2Oct 17, 2025 12:30172,5231,454,717,8191,221,094,000210,843,0002,445,312
3Oct 17, 2025 12:30173,1041,469,247,1381,217,952,000218,811,0002,363,392
4Oct 17, 2025 12:30173,2001,468,671,3041,217,631,000219,933,0002,269,184
5Oct 17, 2025 12:30173,2111,465,650,8781,220,852,000216,796,0002,359,296
6Oct 17, 2025 12:30173,5291,463,598,3411,222,399,000217,892,0002,506,752
7Oct 17, 2025 12:30173,5661,465,242,0231,222,811,000217,788,0002,424,832
8Oct 17, 2025 12:30173,7831,467,197,9881,222,491,000219,908,0002,269,184
9Oct 17, 2025 12:30173,9121,467,541,2271,222,553,000220,919,0002,342,912