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 listFeb 21, 2026 21:45MathSOMathSOScore: 363,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 21:45363,3023,042,983,9292,909,465,000105,944,0002,478,080
2Feb 21, 2026 21:45363,3783,048,534,3142,907,111,000108,929,0002,531,328
3Feb 21, 2026 21:45363,6163,051,312,5752,917,113,000100,900,0002,424,832
4Feb 21, 2026 21:45363,6203,043,450,9652,906,122,000111,927,0002,351,104
5Feb 21, 2026 21:45363,8573,053,105,0772,921,045,00098,967,0002,539,520
6Feb 21, 2026 21:45364,9123,061,176,0802,915,854,000112,916,0002,367,488
7Feb 21, 2026 21:45364,9423,055,496,2832,926,124,000102,898,0002,445,312
8Feb 21, 2026 21:45365,5913,064,456,9422,912,472,000121,936,0002,531,328
9Feb 21, 2026 21:45367,0083,079,688,0062,948,191,00097,973,0002,428,928