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 21, 2024 16:16Vladimir TatVladimir TatScore: 33,980Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 21, 2024 16:1633,944306,383,987280,739,000999,0002,523,136
2Oct 21, 2024 16:1533,954307,721,039279,823,0001,998,0002,289,664
3Oct 21, 2024 16:1533,976308,339,030280,002,0002,000,0002,281,472
4Oct 21, 2024 16:1633,980311,280,111280,037,0002,000,0002,527,232
5Oct 21, 2024 16:1533,984307,281,542281,065,0001,000,0002,289,664
6Oct 21, 2024 16:1633,992316,107,766280,131,0002,000,0002,281,472