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:14Vladimir TatVladimir TatScore: 31,894Success
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:1431,862291,459,211263,456,0001,001,0002,289,664
2Oct 21, 2024 16:1431,878290,743,933263,585,0001,002,0002,289,664
3Oct 21, 2024 16:1431,878290,299,696263,585,0001,002,0002,277,376
4Oct 21, 2024 16:1431,878291,899,721263,588,0001,002,0002,523,136
5Oct 21, 2024 16:1431,894296,025,296262,724,0001,997,0002,289,664
6Oct 21, 2024 16:1431,899290,212,238262,767,0001,998,0002,531,328
7Oct 21, 2024 16:1431,905294,148,240262,814,0001,998,0002,289,664
8Oct 21, 2024 16:1431,907292,255,977262,832,0001,998,0002,281,472
9Oct 21, 2024 16:1431,911287,953,285262,862,0001,998,0002,289,664