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 listMay 7, 2026 10:20wnwnScore: 3,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:203,38844,482,36827,054,0001,068,0002,482,176
2May 7, 2026 10:203,39542,018,60427,153,0001,028,0002,486,272
3May 7, 2026 10:203,39644,231,99027,068,0001,127,0002,494,464
4May 7, 2026 10:203,40042,628,51827,164,0001,062,0002,482,176
5May 7, 2026 10:203,40746,954,12627,167,0001,118,0002,494,464
6May 7, 2026 10:203,49944,278,01227,968,0001,074,0002,478,080
7May 7, 2026 10:203,53547,596,36228,212,0001,131,0002,490,368
8May 7, 2026 10:203,55645,047,89928,386,0001,133,0002,494,464
9May 7, 2026 10:203,60545,558,22328,834,0001,093,0002,478,080