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 11, 2026 18:40olliecrowolliecrowScore: 6,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:405,90881,812,27345,037,0004,003,0002,273,280
2Feb 11, 2026 18:405,97379,976,11447,554,0002,023,0002,269,184
3Feb 11, 2026 18:406,00280,653,03745,834,0003,985,0002,408,448
4Feb 11, 2026 18:406,27880,243,92948,103,0004,008,0002,334,720
5Feb 11, 2026 18:406,34178,633,04248,582,0004,048,0002,428,928
6Feb 11, 2026 18:406,35879,472,93747,790,0004,978,0002,318,336
7Feb 11, 2026 18:406,36183,456,85750,805,0001,992,0002,424,832
8Feb 11, 2026 18:406,37583,476,46048,919,0003,993,0002,453,504
9Feb 11, 2026 18:406,38376,003,13550,981,0001,999,0002,338,816
10Feb 11, 2026 18:406,39179,510,27649,043,0004,003,0002,334,720
11Feb 11, 2026 18:406,40881,149,65147,165,0006,021,0002,338,816
12Feb 11, 2026 18:406,42881,816,28950,331,0003,019,0002,420,736