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 listMar 13, 2026 19:52wnwnScore: 4,337Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 19:524,31765,562,26833,841,0001,990,0002,486,272
2Mar 13, 2026 19:524,32163,773,56633,871,0001,992,0002,502,656
3Mar 13, 2026 19:524,32454,111,63633,896,0001,993,0002,273,280
4Mar 13, 2026 19:524,33359,294,81833,964,0001,997,0002,494,464
5Mar 13, 2026 19:524,33757,576,91233,996,0001,999,0002,273,280
6Mar 13, 2026 19:524,34760,739,40234,080,0002,004,0002,494,464
7Mar 13, 2026 19:524,34859,013,83934,082,0002,004,0002,273,280
8Mar 13, 2026 19:524,37156,123,26935,274,0001,007,0002,273,280
9Mar 13, 2026 19:524,39055,889,68335,424,0001,012,0002,273,280